{"submission_id":20774,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:19","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3058,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:19","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5361,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:24","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18320,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:24","func_code":"def circle_area(r):\n return pi * r * r","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":25991,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:24","func_code":"def rectangle_perimeter(a, b):\n return 2 * a + 2 * b","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":34968,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:24","func_code":"def rectangle_perimeter(a, b):\n return 2 * a + 2 * b\n\n\ndef square_perimeter(n):\n return rectangle_perimeter(n, n)","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":33257,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:24","func_code":"def circle_circumference(r):\n return 2 * pi * r","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":12184,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:24","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41180,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:24","func_code":"def circle_circumference(r):\n return 2 * pi * r","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":28441,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:24","func_code":"def rectangle_perimeter(a, b):\n return 2 * a + 2 * b\n\n\ndef square_perimeter(n):\n return rectangle_perimeter(n, n)","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":34702,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:24","func_code":"def rectangle_perimeter(a, b):\n return 2 * a + 2 * b","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":24446,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-09-26 16:10:24","func_code":"def circle_area(r):\n return pi * r * r","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":6120,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 09:54:04","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":28765,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 09:54:04","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6687,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 10:05:27","func_code":"def circle_area(r):\n area = 3.14 * r ** 2\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":39332,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 10:05:27","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29022,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 10:05:27","func_code":"def rectangle_perimeter(w, l):\n per = w * 2 + l * 2\n return per","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":26966,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 10:05:27","func_code":"def square_perimeter(side):\n sq = side * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":31671,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 10:05:27","func_code":"def rectangle_perimeter(w, l):\n per = w * 2 + l * 2\n return per","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":28587,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 10:05:27","func_code":"def circle_circumference(r):\n cir = 2 * 3.14 * r\n return cir","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":30727,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 10:05:27","func_code":"def circle_area(r):\n area = 3.14 * r ** 2\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":32645,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 10:05:27","func_code":"def circle_circumference(r):\n cir = 2 * 3.14 * r\n return cir","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":35972,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 10:05:27","func_code":"def square_perimeter(side):\n sq = side * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":29877,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-09-27 10:05:27","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29088,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:14:50","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9611,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:15:15","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26128,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:16:33","func_code":"def square_area(n):\n side = n\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":14167,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:37:09","func_code":"def square_area(n):\n bob = n ** 2\n return n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":29975,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:37:27","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17410,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:37:27","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15797,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:37:29","func_code":"def square_area(n):\n sq_ar = n * n\n return sq_ar","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31868,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:37:29","func_code":"def square_area(n):\n sq_ar = n * n\n return sq_ar","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6032,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:37:31","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35406,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:37:31","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37940,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:37:40","func_code":"def square_area(n):\n bob = n ** 2\n return bob","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17792,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:37:40","func_code":"def square_area(n):\n bob = n ** 2\n return bob","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11693,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:38:07","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15071,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:38:07","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11631,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:38:11","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30027,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:38:11","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16862,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:38:43","func_code":"def square_area(n):\n square_area = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25790,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:38:43","func_code":"def square_area(n):\n square_area = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19657,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:39:11","func_code":"def square_area(n):\n square_area = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39757,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:39:11","func_code":"def square_area(n):\n square_area = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":23504,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:39:40","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15872,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:39:40","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9318,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:40:00","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31797,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:40:00","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31742,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 11:40:35","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":14261,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:40:39","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":23283,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:41:09","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":10877,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:42:16","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5690,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:42:16","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":42369,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 11:42:23","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39779,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 11:42:23","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5830,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:42:43","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39159,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:42:43","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16853,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:43:24","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17513,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 11:43:33","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29849,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 11:43:33","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39038,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:43:42","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":14692,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:43:42","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6999,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:43:50","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15607,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:43:50","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2180,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 11:43:51","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20962,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 11:43:51","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":22330,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:43:56","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13218,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:44:01","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11227,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:44:01","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36600,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:44:04","func_code":"def square_perimeter(n):\n bobby = n * 4\n return bobby","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":3121,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:44:04","func_code":"def square_area(n):\n bobby = n ** 2\n return bobby","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41832,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:44:04","func_code":"def rectangle_perimeter(n, x):\n bobby = 2 * n + 2 * x\n return bobby","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":15694,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:44:04","func_code":"def circle_area(n):\n bobby = 3.14 * n ** 2\n return bobby","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":24825,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:09","func_code":"def square_area(n):\n sq_ar = n * n\n return sq_ar","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4078,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:09","func_code":"def square_perimeter(n):\n sq_pm = n * 4\n return sq_pm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":24984,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:09","func_code":"def rectangle_perimeter(n, m):\n re_pm = square_perimeter + m\n return re_pm","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":22868,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:09","func_code":"def circle_circumference(n):\n cr_ci = 2 * 3.14 * n\n return cr_ci","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":31745,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:09","func_code":"def circle_area(n):\n cr_ar = 3.14 * (n * n)\n return cr_ar","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":9306,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:44:12","func_code":"def square_perimeter(side):\n square_perimeter = side + side + side + side\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":9093,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:44:12","func_code":"def circle_area(radius):\n circle_area = radius * radius\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":29275,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:44:12","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":12004,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:44:12","func_code":"def rectangle_perimeter(side1, side2):\n rectangle_perimeter = side1 + side1 + side2 + side2\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":5440,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 11:44:19","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41139,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 11:44:19","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5578,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 11:44:27","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":22150,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 11:44:27","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21075,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:44:32","func_code":"def square_perimeter(n):\n sqper = n ** 2\n return sqper","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":20117,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:44:32","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35593,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:44:32","func_code":"def rectangle_perimeter(n, n1):\n rec = n * n1\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":34807,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:44:32","func_code":"def circle_area(n):\n carea = 3.14 * n ** 2\n return carea","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21985,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:44:32","func_code":"def circle_circumference(n):\n circum = 2 * 3.14 * n\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":15183,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:39","func_code":"def circle_circumference(n):\n cr_ci = 2 * 3.14 * n\n return cr_ci","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":3269,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:39","func_code":"def square_perimeter(n):\n sq_pm = n * 4\n return sq_pm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22471,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:39","func_code":"def rectangle_perimeter(n, m):\n re_pm = sq_pm + m\n return re_pm","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":19171,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:39","func_code":"def circle_area(n):\n cr_ar = 3.14 * (n * n)\n return cr_ar","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":39446,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:39","func_code":"def square_area(n):\n sq_ar = n * n\n return sq_ar","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36319,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 11:44:44","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6334,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 11:44:44","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31377,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:44:45","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4545,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:44:46","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8242,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:44:46","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37963,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:44:46","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15568,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:44:46","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":402,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:44:47","func_code":"def square_perimeter(n):\n sq = n * n\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":9654,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:44:54","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2811,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:44:54","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41563,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:44:56","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":28274,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:44:56","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37507,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:57","func_code":"def square_perimeter(n):\n sq_pm = n * 4\n return sq_pm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":6921,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:57","func_code":"def circle_circumference(n):\n cr_ci = 2 * 3.14 * n\n return cr_ci","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":1006,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:57","func_code":"def circle_area(n):\n cr_ar = 3.14 * (n * n)\n return cr_ar","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":8218,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:57","func_code":"def square_area(n):\n sq_ar = n * n\n return sq_ar","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":12949,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:44:57","func_code":"def rectangle_perimeter(n, m):\n re_pm = n * n + m\n return re_pm","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":7551,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 11:44:58","func_code":"def square_area(x):\n result = x * x\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17933,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 11:44:58","func_code":"def square_area(x):\n result = x * x\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31067,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:45:01","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27161,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:45:01","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36933,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:45:05","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30070,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:45:05","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":29565,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:45:05","func_code":"def square_perimeter(n):\n return 4 * n","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":13439,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:45:05","func_code":"def rectangle_perimeter(n, a):\n return (2 * n)(2 * a)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":35143,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:45:19","func_code":"def rectangle_perimeter(n, m):\n re_pm = n * 2 + m * 2\n return re_pm","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":27869,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:45:19","func_code":"def square_area(n):\n sq_ar = n * n\n return sq_ar","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17376,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:45:19","func_code":"def rectangle_perimeter(n, m):\n re_pm = n * 2 + m * 2\n return re_pm","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":24612,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:45:19","func_code":"def circle_circumference(n):\n cr_ci = 2 * 3.14 * n\n return cr_ci","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":5653,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:45:19","func_code":"def circle_area(n):\n cr_ar = 3.14 * (n * n)\n return cr_ar","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":1514,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:45:19","func_code":"def circle_circumference(n):\n cr_ci = 2 * 3.14 * n\n return cr_ci","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":11648,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:45:19","func_code":"def square_perimeter(n):\n sq_pm = n * 4\n return sq_pm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":10668,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:45:19","func_code":"def circle_area(n):\n cr_ar = 3.14 * (n * n)\n return cr_ar","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":22268,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:45:19","func_code":"def square_area(n):\n sq_ar = n * n\n return sq_ar","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26589,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-09-27 11:45:19","func_code":"def square_perimeter(n):\n sq_pm = n * 4\n return sq_pm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":31271,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 11:45:22","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17280,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:45:24","func_code":"def square_area(n):\n bobby = n ** 2\n return bobby","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20622,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:45:24","func_code":"def circle_area(n):\n bobby = 3.14 * n ** 2\n return bobby","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":13266,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:45:24","func_code":"def circle_circumference(n):\n bobby = n * 2 * 3.14\n return bobby","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":25797,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:45:24","func_code":"def rectangle_perimeter(n, x):\n bobby = 2 * n + 2 * x\n return bobby","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":31901,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:45:24","func_code":"def square_perimeter(n):\n bobby = n * 4\n return bobby","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":12127,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:45:24","func_code":"def rectangle_perimeter(n, x):\n bobby = 2 * n + 2 * x\n return bobby","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":7104,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:45:24","func_code":"def square_area(n):\n bobby = n ** 2\n return bobby","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":40289,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:45:24","func_code":"def square_perimeter(n):\n bobby = n * 4\n return bobby","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":38455,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:45:24","func_code":"def circle_circumference(n):\n bobby = n * 2 * 3.14\n return bobby","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":25468,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-09-27 11:45:24","func_code":"def circle_area(n):\n bobby = 3.14 * n ** 2\n return bobby","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":26963,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:45:26","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5594,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:45:26","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19537,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:45:28","func_code":"def circle_area(n):\n carea = 3.14 * n ** 2\n return carea","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":27463,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:45:28","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35100,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:45:28","func_code":"def rectangle_perimeter(n, n1):\n rec = n * n1\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":14312,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:45:28","func_code":"def circle_circumference(n):\n circum = 2 * 3.14 * n\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":32183,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:45:28","func_code":"def square_perimeter(n):\n sqper = n * n\n return sqper","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":31096,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:45:40","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35749,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:45:48","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":16359,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:45:48","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":23083,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:45:48","func_code":"def square_perimeter(n):\n return 4 * n","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":26993,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:45:48","func_code":"def rectangle_perimeter(n, a):\n return (2 * n)(2 * a)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":20646,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:45:51","func_code":"def square_perimeter(n):\n sqper = n * 4\n return sqper","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":739,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:45:51","func_code":"def rectangle_perimeter(n, n1):\n rec = n * n1\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":40834,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:45:51","func_code":"def circle_area(n):\n carea = 3.14 * n ** 2\n return carea","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":7648,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:45:51","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":38282,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:45:51","func_code":"def circle_circumference(n):\n circum = 2 * 3.14 * n\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":32932,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:46:07","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20589,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:46:07","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33035,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:25","func_code":"def circle_area(n):\n carea = 3.14 * n ** 2\n return carea","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":526,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:25","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25229,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:25","func_code":"def circle_circumference(n):\n circum = 2 * 3.14 * n\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":10636,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:25","func_code":"def rectangle_perimeter(n, m):\n rec = n * 2 and m * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":15489,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:25","func_code":"def square_perimeter(n):\n sqper = n * 4\n return sqper","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":14264,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:46:36","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11440,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:46:36","func_code":"def circle_circumference(n):\n return 2 * 3.14 * n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":7942,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:46:36","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27893,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:46:36","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":29822,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:46:36","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":1555,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:46:36","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":10231,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:46:36","func_code":"def rectangle_perimeter(n, a):\n return 2 * a + 2 * n","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":7017,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:46:36","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36998,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:46:36","func_code":"def rectangle_perimeter(n, a):\n return 2 * a + 2 * n","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":3207,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-09-27 11:46:36","func_code":"def circle_circumference(n):\n return 2 * 3.14 * n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":27940,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:39","func_code":"def square_perimeter(n):\n sqper = n * 4\n return sqper","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22398,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:39","func_code":"def rectangle_perimeter(n, m):\n rec = n * 2 + m * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":31782,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:39","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3940,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:39","func_code":"def circle_area(n):\n carea = 3.14 * n ** 2\n return carea","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":5546,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:39","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":38186,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:39","func_code":"def rectangle_perimeter(n, m):\n rec = n * 2 + m * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":29274,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:39","func_code":"def circle_area(n):\n carea = 3.14 * n ** 2\n return carea","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":7692,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:39","func_code":"def circle_circumference(n):\n circum = 2 * 3.14 * n\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":28,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:39","func_code":"def square_perimeter(n):\n sqper = n * 4\n return sqper","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":1943,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-09-27 11:46:39","func_code":"def circle_circumference(n):\n circum = 2 * 3.14 * n\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":10363,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:46:57","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30598,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:46:57","func_code":"def square_perimeter(n):\n return 4 * n","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":7401,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:46:57","func_code":"def rectangle_perimeter(n, a):\n return (2 * n)(2 * a)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":24474,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:46:57","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":17337,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:47:23","func_code":"def square_perimeter(n):\n return 4 * n","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11037,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:47:23","func_code":"def rectangle_perimeter(n, a):\n return (2 * n)(2 * a)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":9345,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:47:23","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":37479,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:47:23","func_code":"def circle_circumference(n):\n return 2 * 3.14 * n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":28978,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:47:23","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29610,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:47:25","func_code":"def circle_area(radius):\n return radius * radius * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21215,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:47:25","func_code":"def rectangle_perimeter(side1, side2):\n return side1 + side1 + side2 + side2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":30966,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:47:25","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4918,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:47:25","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11888,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:47:55","func_code":"def rectangle_perimeter(n, a):\n return (2 * n)(2 * a)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":6365,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:47:55","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":24743,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:47:55","func_code":"def square_perimeter(n):\n return 4 * n","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":4920,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:47:55","func_code":"def circle_circumference(n):\n return 2 * 3.14 * n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":39440,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:47:55","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37434,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:48:35","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9528,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:48:35","func_code":"def rectangle_perimeter(side1, side2):\n return side1 + side1 + side2 + side2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":5189,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:48:35","func_code":"def rectangle_perimeter(side1, side2):\n return side1 + side1 + side2 + side2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":37809,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:48:35","func_code":"def circle_area(radius):\n return radius * radius * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":39567,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:48:35","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":6026,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:48:35","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":4481,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:48:35","func_code":"def circle_circumference(radius):\n return 2 * 3.14 * radius","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":21511,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:48:35","func_code":"def circle_area(radius):\n return radius * radius * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":40526,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:48:35","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37310,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-09-27 11:48:35","func_code":"def circle_circumference(radius):\n return 2 * 3.14 * radius","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":24717,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:48:46","func_code":"def circle_circumference(n):\n return 2 * 3.14 * n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":334,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:48:46","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":33037,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:48:46","func_code":"def rectangle_perimeter(n, a):\n return (2 * a)(2 * n)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":7914,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:48:46","func_code":"def square_perimeter(n):\n return 4 * n","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":34355,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:48:46","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29874,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-27 11:48:46","func_code":"def square_area(n):\n result = n ** n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":22166,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 11:48:51","func_code":"def square_area(n):\n side = n ** 2\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29588,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 11:48:51","func_code":"def square_area(n):\n side = n ** 2\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":1359,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 11:49:02","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6020,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 11:49:02","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37833,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 11:49:05","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3028,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:13","func_code":"def rectangle_perimeter(n, a):\n return (2 * a)(2 * n)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":18939,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:13","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":12560,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:13","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":34472,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:13","func_code":"def square_perimeter(n):\n return 4 * n","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":17072,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:13","func_code":"def circle_circumference(n):\n return 2 * 3.14 * n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":33627,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:26","func_code":"def rectangle_perimeter(n, a):\n return (2 * a)(2 * n)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":11688,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:26","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":26040,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:26","func_code":"def circle_circumference(n):\n return 2 * 3.14 * n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":31522,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:26","func_code":"def square_perimeter(n):\n return 4 * n","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":35309,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:26","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":28257,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:39","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":26909,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:39","func_code":"def square_perimeter(n):\n return 4 * n","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":34141,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:39","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13884,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:39","func_code":"def circle_circumference(n):\n return 2 * 3.14 * n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":14342,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:39","func_code":"def square_perimeter(n):\n return 4 * n","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":32176,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:39","func_code":"def rectangle_perimeter(n, a):\n return 2 * a + 2 * n","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":24006,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:39","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39185,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:39","func_code":"def circle_area(n):\n return 3.14 * n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":28028,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:39","func_code":"def rectangle_perimeter(n, a):\n return 2 * a + 2 * n","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":17774,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-09-27 11:49:39","func_code":"def circle_circumference(n):\n return 2 * 3.14 * n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":13202,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 11:49:51","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":42218,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 11:49:51","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":29415,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 11:49:51","func_code":"def rectangle_perimeter(n):\n result = n + n + n + n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":31843,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 11:49:51","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":28469,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:50:11","func_code":"def rectangle_perimeter(n, m):\n result = n * 2 + m * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":12605,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:50:11","func_code":"def square_perimeter(n):\n result = n * 4\n return reult","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":15901,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:50:11","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30300,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:50:11","func_code":"def circle_area(n):\n result = 3.14 * (n + n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":27848,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:50:32","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13569,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:50:32","func_code":"def circle_area(side):\n result = 3.14 * side ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":5946,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:50:32","func_code":"def circle_circumference(side):\n result = 2 * 3.14 * side\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":16501,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:50:32","func_code":"def rectangle_perimeter(sideA, sideB):\n result = sideA * 2 + sideB * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":5586,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:50:32","func_code":"def square_perimeter(side):\n result = side + side\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":1461,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 11:50:33","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19777,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:50:33","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31770,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:50:33","func_code":"def rectangle_perimeter(n, m):\n result = n * 2 + m * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":14123,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:50:33","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":8436,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 11:50:33","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13404,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:50:33","func_code":"def circle_area(n):\n result = 3.14 * (n + n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":15025,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:50:37","func_code":"def square_perimeter(n):\n sq = n * n\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":7044,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:50:37","func_code":"def rectangle_perimeter(n):\n sq = n * n\n return sq","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":41200,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:50:37","func_code":"def circle_area(n):\n sq = n * n\n return sq","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":22459,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:50:37","func_code":"def circle_circumference(n):\n sq = n * n\n return sq","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":1045,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 11:50:54","func_code":"def square_area(n):\n side = n ** 2\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29905,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 11:50:54","func_code":"def square_area(n):\n side = n ** 2\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21633,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 11:51:16","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30501,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:51:26","func_code":"def square_perimeter(side):\n result = side + side\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":6860,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:51:26","func_code":"def circle_area(radius):\n result = 3.14 * radius ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":29003,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:51:26","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":31727,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:51:26","func_code":"def rectangle_perimeter(sideA, sideB):\n result = sideA * 2 + sideB * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":25919,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:51:26","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13629,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 11:51:34","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2088,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:51:43","func_code":"def circle_area(n):\n sq = n * n\n return sq","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":36660,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:51:43","func_code":"def circle_circumference(n):\n sq = n * n\n return sq","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":36496,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:51:43","func_code":"def rectangle_perimeter(n):\n sq = n * n\n return sq","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":23243,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:51:43","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13609,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 11:51:43","func_code":"def square_perimeter(n):\n sq = n * n\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":40908,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 11:52:04","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15861,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:52:09","func_code":"def rectangle_perimeter(n):\n result = n + m + n + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":32324,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:52:09","func_code":"def circle_area(n):\n result = (3.14)(n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":33807,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:52:09","func_code":"def circle_circumference(n):\n result = (2)(3.14)(n)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":27971,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:52:09","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11311,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:52:16","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":20155,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:52:16","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n print(result)","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":39283,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:52:22","func_code":"def rectangle_perimeter(sideA, sideB):\n result = sideA * 2 + sideB * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":34562,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:52:22","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26766,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:52:22","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":7802,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:52:22","func_code":"def circle_area(radius):\n result = 3.14 * radius ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":17359,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:52:22","func_code":"def square_perimeter(y):\n result = y + y\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":42324,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 11:52:28","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4222,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:52:48","func_code":"def rectangle_perimeter(n):\n result = n + m + n + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":865,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:52:48","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21052,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:52:48","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":3528,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:52:48","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":33521,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:52:49","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37406,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:52:49","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8877,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 11:52:57","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":28357,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 11:52:57","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15768,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 11:53:04","func_code":"def circle_circumference(n):\n square = n * 8\n return square","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":6605,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:53:04","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":9873,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 11:53:04","func_code":"def circle_area(n):\n square = n * 88\n return square","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":369,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 11:53:04","func_code":"def square_perimeter(n):\n square = 9 * n\n return square","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":5626,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 11:53:04","func_code":"def rectangle_perimeter(n):\n square = n * 7\n return square","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":32825,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 11:53:04","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9385,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:53:04","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n print(result)","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":23584,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:05","func_code":"def rectangle_perimeter(n, m):\n result = n + m","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":41684,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:05","func_code":"def circle_area(n):\n result = n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":2980,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:05","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2571,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:05","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":21175,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:05","func_code":"def square_perimeter(n):\n result = n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":10902,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:53:17","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":34686,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:53:17","func_code":"def rectangle_perimeter(sideA, sideB):\n result = sideA * 2 + sideB * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":17464,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:53:17","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":36581,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:53:17","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":41333,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:53:17","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":23715,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:53:17","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18175,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:53:17","func_code":"def rectangle_perimeter(sideA, sideB):\n result = sideA * 2 + sideB * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":39890,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:53:17","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11922,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:53:17","func_code":"def circle_area(radius):\n result = 3.14 * radius ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":1676,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-09-27 11:53:17","func_code":"def circle_area(radius):\n result = 3.14 * radius ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":33283,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:53:19","func_code":"def square_perimeter(n):\n square_perimeter = x + y * 2\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":35099,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:53:19","func_code":"def circle_circumference(r):\n circle_circumference = 2 * 3.141 * r\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":26308,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:53:19","func_code":"def square_area(n):\n square_area = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2238,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:53:19","func_code":"def circle_area(r):\n circle_area = r * r * 3.141\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":26916,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:53:23","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6875,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:53:23","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13867,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:53:24","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8333,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:53:24","func_code":"def rectangle_perimeter(a, b):\n result = a + b + a + b\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":29149,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:53:24","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":32946,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:53:24","func_code":"def circle_circumference(n):\n result = 2 * 3.14 + n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":36773,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:53:24","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10467,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:53:28","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":4544,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:53:28","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6830,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:53:28","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5229,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:53:28","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":24495,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:53:28","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":20746,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:53:28","func_code":"def rectangle_perimeter(x, y):\n result = 2 * x + 2 * y\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":14660,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:53:28","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":20290,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:53:28","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":23159,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:53:28","func_code":"def rectangle_perimeter(x, y):\n result = 2 * x + 2 * y\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":15423,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-09-27 11:53:28","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":23058,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 11:53:31","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5888,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 11:53:31","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":10472,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:32","func_code":"def circle_circumference(n):\n result3 = 2 * 3.14 * n\n return result3","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":30953,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:32","func_code":"def rectangle_perimeter(n, m):\n result4 = n + m\n return result4","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":33747,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:32","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31222,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:32","func_code":"def circle_area(n):\n result2 = n * n\n return result2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":28162,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:32","func_code":"def square_perimeter(n):\n result1 = n + n\n return result1","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":4324,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:53:44","func_code":"def circle_circumference(r):\n circle_circumference = 2 * 3.141 * r\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":26505,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:53:44","func_code":"def square_perimeter(n):\n square_perimeter = n + y * 2\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":14596,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:53:44","func_code":"def circle_area(r):\n circle_area = r * r * 3.141\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":28583,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:53:44","func_code":"def square_area(n):\n square_area = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35108,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 11:53:51","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3497,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 11:53:51","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7595,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:53:56","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":2948,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 11:53:56","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21264,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:53:56","func_code":"def rectangle_perimeter(n):\n result = n + n + n + n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":32013,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:53:56","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":23100,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:53:56","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":259,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 11:53:56","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30882,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 11:53:56","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":9310,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:57","func_code":"def circle_area(n):\n result2 = n * n\n return result2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":16040,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:53:57","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":7898,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:57","func_code":"def rectangle_perimeter(n, m):\n result4 = n + m + n + m\n return result4","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":15067,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:53:57","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21154,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:57","func_code":"def circle_circumference(n):\n result3 = 2 * 3.14 * n\n return result3","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":2290,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:53:57","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3584,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:53:57","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":27025,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:57","func_code":"def square_perimeter(n):\n result1 = n + n + n + n\n return result1","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":2519,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:53:57","func_code":"def rectangle_perimeter(a, b):\n result = a + b + a + b\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":11172,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:53:57","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30449,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:53:59","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n print(result)","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":28557,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:53:59","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":13326,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:53:59","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15229,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:54:01","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":2632,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:54:01","func_code":"def rectangle_perimeter(n, m):\n result = n * 2 + m * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":24341,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:54:01","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":27533,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:54:01","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2449,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 11:54:10","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35582,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:54:19","func_code":"def circle_area(n):\n sq = n * n\n return sq","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":32930,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:54:19","func_code":"def rectangle_perimeter(n):\n sq = n * n\n return sq","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":15651,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:54:19","func_code":"def square_perimeter(n):\n sq = n * n\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":33438,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:54:19","func_code":"def circle_circumference(n):\n sq = n * n\n return sq","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":23254,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:54:19","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2192,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 11:54:33","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21415,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 11:54:33","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":14490,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:54:41","func_code":"def circle_area(n):\n result2 = 3.14 * (n * n)\n return result2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":31330,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:54:41","func_code":"def square_perimeter(n):\n result1 = n + n + n + n\n return result1","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":23663,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 11:54:41","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18251,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:54:41","func_code":"def circle_circumference(n):\n result3 = 2 * 3.14 * n\n return result3","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":33899,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:54:41","func_code":"def circle_area(n):\n result2 = 3.14 * (n * n)\n return result2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":15601,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:54:41","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":24947,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:54:41","func_code":"def rectangle_perimeter(n, m):\n result4 = n + m + n + m\n return result4","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":14630,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:54:41","func_code":"def circle_circumference(n):\n result3 = 2 * 3.14 * n\n return result3","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":17036,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:54:41","func_code":"def rectangle_perimeter(n, m):\n result4 = n + m + n + m\n return result4","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":27593,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:54:41","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21629,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-09-27 11:54:41","func_code":"def square_perimeter(n):\n result1 = n + n + n + n\n return result1","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30192,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:54:49","func_code":"def circle_area(n):\n sq = n * n\n return sq","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":41147,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:54:49","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17223,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:54:49","func_code":"def circle_circumference(n):\n sq = n * n\n return sq","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":20561,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:54:49","func_code":"def rectangle_perimeter(n):\n sq = n * n\n return sq","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":36556,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:54:49","func_code":"def square_perimeter(n):\n sq = n * 3\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":497,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:54:57","func_code":"def rectangle_perimeter(n):\n result = 2 * n * n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":3392,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:54:57","func_code":"def circle_area(n):\n result = 3.14 * 2 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":11514,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:54:57","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":37497,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:54:57","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41379,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:55:02","func_code":"def square_perimeter(n):\n sq = n ** n\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":20890,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:55:02","func_code":"def circle_area(n):\n sq = n * n\n return sq","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":8505,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:55:02","func_code":"def rectangle_perimeter(n):\n sq = n * n\n return sq","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":33937,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:55:02","func_code":"def circle_circumference(n):\n sq = n * n\n return sq","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":12666,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:55:02","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26046,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:55:04","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":20999,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:55:04","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19310,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:55:04","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":15180,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:55:04","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":14353,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 11:55:04","func_code":"def rectangle_perimeter(n, m):\n result = n * 2 + m * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":28483,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:55:05","func_code":"def square_area(s):\n sq = s * s\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7939,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:55:06","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37137,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:55:06","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n print(result)","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":40243,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:55:06","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":11336,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:55:31","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":31560,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:55:31","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":3193,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:55:31","func_code":"def circle_area(n):\n result = 3.14 * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":1913,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:55:31","func_code":"def rectangle_perimeter(n):\n result = n + n + n + n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":32348,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:55:36","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":15318,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:55:36","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":6786,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:55:36","func_code":"def rectangle_perimeter(n):\n result = n * 4\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":34221,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:55:36","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n print(result)","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":36650,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:55:36","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9787,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:55:48","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":7623,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:55:48","func_code":"def rectangle_perimeter(n):\n result = n + n + n + n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":30933,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:55:48","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":7573,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:55:48","func_code":"def circle_area(n):\n result = 3.14 * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":18473,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:55:49","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":31997,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:55:49","func_code":"def rectangle_perimeter(a, b):\n result = a + b + a + b\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":36913,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:55:49","func_code":"def square_perimeter(n):\n square_perimeter = n * 4\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":32412,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:55:49","func_code":"def circle_circumference(r):\n circle_circumference = 2 * 3.141 * r\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":16264,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:55:49","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4747,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:55:49","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":3264,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:55:49","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":14833,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:55:49","func_code":"def rectangle_perimeter(a, b):\n result = a + b + a + b\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":29734,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:55:49","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26586,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:55:49","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":16903,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:55:49","func_code":"def square_area(n):\n square_area = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5702,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:55:49","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":8750,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:55:49","func_code":"def circle_area(r):\n circle_area = r * r * 3.141\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":7847,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-09-27 11:55:49","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":21786,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:55:50","func_code":"def rectangle_perimeter(n):\n sq = n * n\n return sq","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":33839,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:55:50","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":418,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:55:50","func_code":"def square_perimeter(n):\n sq = n * n\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":36292,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:55:50","func_code":"def circle_area(n):\n sq = n * n\n return sq","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":19770,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:55:50","func_code":"def circle_circumference(n):\n sq = n * n\n return sq","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":13753,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 11:55:54","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2146,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 11:55:54","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":33382,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:56:12","func_code":"def square_perimeter(n):\n sq = 4 * n\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":1170,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:56:12","func_code":"def rectangle_perimeter(n):\n result = 2 * n * n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":35365,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:56:12","func_code":"def circle_area(n):\n result = 3.14 * 2 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":21354,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:56:12","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":27263,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:56:15","func_code":"def circle_circumference(radius):\n return 2 * 3.14 * radius","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":33394,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:56:15","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39730,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:56:15","func_code":"def circle_area(radius):\n return 3.14 * radius ** 2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":12398,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:56:15","func_code":"def rectangle_perimeter(side, height):\n return (2)(side + height)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":5557,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:56:15","func_code":"def square_perimeter(side):\n return side + side * 2","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":27164,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 11:56:25","func_code":"def rectangle_perimeter(n, m):\n perim = 2 * (n + m)\n return perim","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":26084,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 11:56:25","func_code":"def circle_circumference(n):\n circumf = 2 * 3.14 * n\n return circumf","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":20775,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 11:56:25","func_code":"def circle_area(n):\n area = 3.14 * (n * n)\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":30312,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 11:56:25","func_code":"def square_perimeter(n):\n perim = n * n\n return perim","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":40591,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:56:39","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":9752,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:56:39","func_code":"def circle_area(n):\n result = 3.14 * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":31312,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:56:39","func_code":"def rectangle_perimeter(n):\n result = n + n + n + n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":16631,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:56:39","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25280,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:56:39","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":10173,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 11:57:04","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13897,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 11:57:04","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37239,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:57:13","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":20877,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:57:13","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":9384,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:57:13","func_code":"def circle_circumference(n):\n result = (2)(3.14 * n)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":32667,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:57:13","func_code":"def circle_area(n):\n result = (3.14 * n) ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":33232,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:57:13","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":757,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:57:23","func_code":"def circle_area(radius):\n return 3.14 * radius ** 2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":35809,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:57:23","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29319,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:57:23","func_code":"def circle_circumference(radius):\n return 2 * 3.14 * radius","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":20384,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:57:23","func_code":"def rectangle_perimeter(side, height):\n return (2)(side + height)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":32612,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:57:23","func_code":"def square_perimeter(side):\n return (2)(side + side)","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":27973,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 11:57:36","func_code":"def rectangle_perimeter():\n rectangle_perimeter = side + side + side + side\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":20379,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 11:57:36","func_code":"def circle_area(side):\n circle_area = 3.14 * side * side\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":13835,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 11:57:36","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":22135,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 11:57:36","func_code":"def square_perimeter(side):\n square_perimeter = side + side + side + side\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20321,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 11:57:42","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36442,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 11:57:42","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":17517,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 11:57:42","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":13022,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 11:57:42","func_code":"def circle_area(n):\n result = (3.14 + n) ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":4888,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 11:57:42","func_code":"def circle_circumference(n):\n result = 2 * (3.14 * n)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":12606,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:57:49","func_code":"def square_perimeter(side):\n perimeter = side * 4\n return perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30869,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:57:49","func_code":"def rectangle_perimeter(a, b):\n per = a * 2 + b * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":6050,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:57:49","func_code":"def circle_circumference(r):\n circum = 2 * 3.14 * r\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":1344,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:57:49","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5330,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:57:49","func_code":"def circle_area(r):\n cir = 3.14 * (r * r)\n return cir","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":39206,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 11:57:52","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30087,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 11:57:52","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9293,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:57:54","func_code":"def circle_area(r):\n circle_area = r * r * 3.141\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":346,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:57:54","func_code":"def square_perimeter(n):\n square_perimeter = n * 4\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":14535,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:57:54","func_code":"def circle_circumference(r):\n circle_circumference = 2 * 3.141 * r\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":37282,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:57:54","func_code":"def square_area(n):\n square_area = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18257,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:58:19","func_code":"def square_perimeter(n):\n square_perimeter = n * 4\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":39765,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:58:19","func_code":"def circle_circumference(r):\n circle_circumference = 2 * 3.14 * r\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":9194,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:58:19","func_code":"def square_area(n):\n square_area = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21370,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:58:19","func_code":"def circle_area(r):\n circle_area = r * r * 3.14\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10006,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:58:19","func_code":"def square_perimeter(n):\n square_perimeter = n * 4\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20607,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:58:19","func_code":"def circle_circumference(r):\n circle_circumference = 2 * 3.14 * r\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":27253,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:58:19","func_code":"def square_area(n):\n square_area = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7709,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-09-27 11:58:19","func_code":"def circle_area(r):\n circle_area = r * r * 3.14\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":41546,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:58:23","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":538,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:58:23","func_code":"def rectangle_perimeter(a, b):\n result = a * 2 + b * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":27831,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:58:23","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37585,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:58:23","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n print(result)","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":14512,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:58:23","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5512,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:58:28","func_code":"def rectangle_perimeter(side, height):\n return (2)(side + height)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":38494,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:58:28","func_code":"def circle_circumference(radius):\n return 2 * 3.14 * radius","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":11351,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:58:28","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":38945,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:58:28","func_code":"def circle_area(radius):\n return 3.14 * radius ** 2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":19277,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:58:28","func_code":"def square_perimeter(side):\n return (4)(side)","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":11563,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:32","func_code":"def square_perimeter(side):\n perimeter = side * 4\n return perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":36518,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:32","func_code":"def circle_area(r):\n cir = 3.14 * (r * r)\n return cir","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":28021,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:32","func_code":"def circle_circumference(r):\n circum = 2 * 3.14 * r\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":36510,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:32","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21844,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:32","func_code":"def rectangle_perimeter(a, b):\n per = a * 2 + b * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":40826,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:58:38","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":40411,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:58:38","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * r\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":20513,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:58:38","func_code":"def rectangle_perimeter(n):\n result = n + n + n + n","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":3674,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:58:38","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":36537,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:58:38","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17243,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:58:47","func_code":"def rectangle_perimeter(n):\n result = 2 * n * n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":29372,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:58:47","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11155,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:58:47","func_code":"def circle_area(n):\n result = 3.14 * 2 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":16463,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:58:47","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":13109,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 11:58:47","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30376,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:58:53","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5294,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:58:53","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":3420,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:58:53","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":480,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:58:53","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":41244,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:58:53","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":224,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:58:53","func_code":"def rectangle_perimeter(x, y):\n result = x + y + x + y\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":33020,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:58:53","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":12020,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:58:53","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":17192,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:58:53","func_code":"def rectangle_perimeter(x, y):\n result = x + y + x + y\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":38365,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-09-27 11:58:53","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":22125,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:55","func_code":"def square_perimeter(side):\n perimeter = side * 4\n return perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":23295,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:58:55","func_code":"def square_perimeter(side):\n return 4 * side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":15621,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:55","func_code":"def circle_circumference(r):\n circum = 2 * 3.14 * r\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":41212,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:55","func_code":"def rectangle_perimeter(a, b):\n per = a * 2 + b * 2\n return per","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":28760,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:55","func_code":"def circle_area(r):\n cir = 3.14 * (r * r)\n return cir","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":26350,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:55","func_code":"def circle_area(r):\n cir = 3.14 * (r * r)\n return cir","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":37822,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:55","func_code":"def circle_circumference(r):\n circum = 2 * 3.14 * r\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":19144,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:55","func_code":"def square_perimeter(side):\n perimeter = side * 4\n return perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":38272,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:58:55","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9962,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:58:55","func_code":"def rectangle_perimeter(side, height):\n return (2)(side + height)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":38528,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:55","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19477,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:55","func_code":"def rectangle_perimeter(a, b):\n per = a * 2 + b * 2\n return per","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":21114,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-09-27 11:58:55","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25070,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:58:55","func_code":"def circle_area(radius):\n return 3.14 * radius ** 2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":19457,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:58:55","func_code":"def circle_circumference(radius):\n return 2 * 3.14 * radius","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":34999,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:59:02","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":22411,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:59:02","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":38020,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:59:02","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29817,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:59:02","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22612,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:59:02","func_code":"def rectangle_perimeter(n):\n result = n + n + n + n","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":628,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:59:03","func_code":"def rectangle_perimeter(n, b):\n result = n + b + n + b\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":32297,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:59:03","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":3920,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:59:03","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":21711,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:59:03","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":879,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:59:03","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8914,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:59:03","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":25264,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:59:03","func_code":"def circle_area(n):\n result = 3.14 * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":23326,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:59:03","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16118,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:59:03","func_code":"def rectangle_perimeter(n, b):\n result = n + b + n + b\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":12126,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-09-27 11:59:03","func_code":"def circle_area(n):\n result = 3.14 * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":40192,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 11:59:16","func_code":"def rectangle_perimeter(n):\n result = n * n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":3147,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 11:59:16","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35939,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 11:59:16","func_code":"def circle_area(n):\n result = n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":16417,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 11:59:16","func_code":"def square_perimeter(n):\n result = n * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":40959,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 11:59:16","func_code":"def circle_circumference(n):\n result = n * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":16222,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 11:59:17","func_code":"def circle_area(side):\n circle_area = 3.14 * side * side\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":23788,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 11:59:17","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25811,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 11:59:17","func_code":"def rectangle_perimeter():\n rectangle_perimeter = side + side + side + side\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":19904,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 11:59:17","func_code":"def square_perimeter(side):\n square_perimeter = side + side + side + side\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":34605,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 11:59:19","func_code":"def circle_area(n):\n area = 3.14 * (n * n)\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":19115,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 11:59:19","func_code":"def circle_circumference(n):\n circumf = 2 * 3.14 * n\n return circumf","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":17145,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 11:59:19","func_code":"def square_perimeter(n):\n perim = n * n\n return perim","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":23276,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 11:59:19","func_code":"def rectangle_perimeter(n, m):\n perim = 2 * (n + m)\n return perim","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":3649,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 11:59:19","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5896,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:59:25","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":10077,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:59:25","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11414,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:59:25","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":11531,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:59:25","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":19265,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 11:59:25","func_code":"def rectangle_perimeter(a, b):\n result = a * 2 + b * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":39942,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:59:26","func_code":"def circle_area(r):\n cir = 3.14 * (r * r)\n return cir","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":2286,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:59:26","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11208,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:59:26","func_code":"def circle_circumference(r):\n circum = 2 * 3.14 * r\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":3847,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:59:26","func_code":"def circle_area(r):\n cir = 3.14 * (r * r)\n return cir","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":36111,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:59:26","func_code":"def rectangle_perimeter(a, b):\n per = a * 2 + b * 2\n return per","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":20793,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:59:26","func_code":"def circle_circumference(r):\n circum = 2 * 3.14 * r\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":41161,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:59:26","func_code":"def square_perimeter(side):\n perimeter = side * 4\n return perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":32647,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:59:26","func_code":"def square_area(side):\n sq = side * side\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":22344,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:59:26","func_code":"def square_perimeter(side):\n perimeter = side * 4\n return perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":39854,"user":"b7585673-32a8-4540-86b9-5a9929681908","date":"2017-09-27 11:59:26","func_code":"def rectangle_perimeter(a, b):\n per = a * 2 + b * 2\n return per","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":27172,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:59:32","func_code":"def circle_area(n):\n result = (3.14 * n) ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":40748,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:59:32","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2526,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:59:32","func_code":"def circle_circumference(n):\n result = 2 * (3.14 * n)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":30782,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:59:32","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":42276,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 11:59:32","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":13163,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:59:35","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30436,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:59:35","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20863,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:59:35","func_code":"def rectangle_perimeter(n):\n result = n + n + m + m","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":2966,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:59:35","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21647,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 11:59:35","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":37637,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:36","func_code":"def square_area(s):\n sq = s * s\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6063,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:36","func_code":"def square_area(s):\n sq = s * s\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":42395,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:59:38","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":10455,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:59:38","func_code":"def circle_area(n):\n circle = n * n\n return circle","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":32095,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:59:38","func_code":"def rectangle_perimeter(n):\n rectangle = n * n\n return retangle","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":20760,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:59:38","func_code":"def circle_circumference(n):\n circumference = n * n\n return circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":31619,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 11:59:38","func_code":"def square_perimeter(n):\n perimeter = n * n\n return perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":14618,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:41","func_code":"def rectangle_perimeter(a, b):\n sq = a * 2 + b * 2\n return sq","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":39364,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:41","func_code":"def circle_circumference(s):\n sq = 2 * 3.14 * s\n return sq","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":24800,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:41","func_code":"def circle_area(s):\n sq = s ** 2 * 3.14\n return sq","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":15169,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:41","func_code":"def circle_area(s):\n sq = s ** 2 * 3.14\n return sq","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":30426,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:41","func_code":"def square_perimeter(s):\n sq = s * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":39610,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:41","func_code":"def square_perimeter(s):\n sq = s * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22718,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:41","func_code":"def square_area(s):\n sq = s * s\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25551,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:41","func_code":"def rectangle_perimeter(a, b):\n sq = a * 2 + b * 2\n return sq","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":35330,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:41","func_code":"def circle_circumference(s):\n sq = 2 * 3.14 * s\n return sq","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":42037,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-09-27 11:59:41","func_code":"def square_area(s):\n sq = s * s\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":304,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 11:59:53","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":23970,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 11:59:53","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":9054,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 11:59:53","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":529,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 11:59:53","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":7439,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 11:59:53","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":35102,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:59:58","func_code":"def square_perimeter(side):\n return 4 * side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":18459,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:59:58","func_code":"def rectangle_perimeter(side, height):\n return 2 * (side + height)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":25683,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:59:58","func_code":"def square_perimeter(side):\n return 4 * side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":23805,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:59:58","func_code":"def circle_circumference(radius):\n return 2 * 3.14 * radius","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":17338,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:59:58","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36391,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:59:58","func_code":"def circle_area(radius):\n return 3.14 * radius ** 2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":279,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:59:58","func_code":"def circle_area(radius):\n return 3.14 * radius ** 2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":33376,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:59:58","func_code":"def circle_circumference(radius):\n return 2 * 3.14 * radius","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":27336,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:59:58","func_code":"def rectangle_perimeter(side, height):\n return 2 * (side + height)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":15239,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-09-27 11:59:58","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30957,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 12:00:08","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":8043,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 12:00:08","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":1883,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 12:00:08","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":16893,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 12:00:08","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":2847,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 12:00:08","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":32477,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 12:00:08","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9424,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 12:00:08","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":11162,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 12:00:08","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":21338,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 12:00:08","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":14295,"user":"bdc790c5-9f6f-4907-83fb-bb9c00cbd2d1","date":"2017-09-27 12:00:08","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":31756,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:00:13","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":24310,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:00:13","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":34601,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:00:13","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22800,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:00:13","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33760,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:00:13","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":24769,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:17","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":9825,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:17","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5320,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:17","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10233,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:17","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5404,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:17","func_code":"def rectangle_perimeter(n, m):\n result = cd\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":27969,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:00:19","func_code":"def circle_area(side):\n circle_area = 3.14 * side * side\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":37676,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:00:19","func_code":"def circle_circumference(side):\n circle_circumference = side * 2 * 3.14\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":4931,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:00:19","func_code":"def square_perimeter(side):\n square_perimeter = side + side + side + side\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":33338,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:00:19","func_code":"def rectangle_perimeter():\n rectangle_perimeter = side + side + side + side\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":38400,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:00:19","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5078,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:00:26","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":21453,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:00:26","func_code":"def circle_circumference(n):\n result = 2 * (3.14 * n)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":42270,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:00:26","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":19483,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:00:26","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5217,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:00:26","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":31700,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 12:00:31","func_code":"def square_perimeter(n):\n perim = 4 * n\n return perim","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":24391,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 12:00:31","func_code":"def circle_circumference(n):\n circumf = 2 * 3.14 * n\n return circumf","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":23129,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 12:00:31","func_code":"def circle_circumference(n):\n circumf = 2 * 3.14 * n\n return circumf","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":9773,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 12:00:31","func_code":"def circle_area(n):\n area = 3.14 * (n * n)\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":12484,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 12:00:31","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6311,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 12:00:31","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41092,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 12:00:31","func_code":"def rectangle_perimeter(n, m):\n perim = 2 * (n + m)\n return perim","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":17006,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 12:00:31","func_code":"def rectangle_perimeter(n, m):\n perim = 2 * (n + m)\n return perim","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":30249,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 12:00:31","func_code":"def square_perimeter(n):\n perim = 4 * n\n return perim","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":37922,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-09-27 12:00:31","func_code":"def circle_area(n):\n area = 3.14 * (n * n)\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":12950,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:36","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10033,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:36","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22477,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:36","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30252,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:36","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":26245,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:36","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":32442,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:36","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":11535,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:36","func_code":"def rectangle_perimeter(n, m):\n result = n + m + n + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":6367,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:36","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":20684,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:36","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":19453,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2017-09-27 12:00:36","func_code":"def rectangle_perimeter(n, m):\n result = n + m + n + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":4225,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:00:47","func_code":"def square_perimeter(side):\n square_perimeter = side + side + side + side\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":35419,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:00:47","func_code":"def rectangle_perimeter(side):\n rectangle_perimeter = side + side + side + side\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":11713,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:00:47","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6647,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:00:47","func_code":"def circle_circumference(side):\n circle_circumference = side * 2 * 3.14\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":21649,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:00:47","func_code":"def circle_area(side):\n circle_area = 3.14 * side * side\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":7045,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:00:51","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":2570,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:00:51","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11064,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:00:51","func_code":"def rectangle_perimeter(n):\n result = 2 * n + n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":30208,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:00:51","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":8677,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 12:00:54","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18410,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 12:00:54","func_code":"def circle_circumference(n):\n result = 2 * (3.14 * n)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":39904,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 12:00:54","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":12661,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 12:00:54","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":25163,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 12:00:54","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30241,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 12:00:54","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":32089,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 12:00:54","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":32162,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 12:00:54","func_code":"def circle_circumference(n):\n result = 2 * (3.14 * n)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":23362,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 12:00:54","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":14720,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2017-09-27 12:00:54","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30700,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:05","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20778,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:05","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":4446,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:05","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":7938,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:05","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":16286,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:05","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":10125,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 12:01:09","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":12775,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 12:01:09","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":8201,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 12:01:09","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5789,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 12:01:09","func_code":"def rectangle_perimeter(a, b):\n result = a * 2 + b * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":24766,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 12:01:09","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":41468,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 12:01:09","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33605,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 12:01:09","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":10861,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 12:01:09","func_code":"def rectangle_perimeter(a, b):\n result = a * 2 + b * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":41447,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 12:01:09","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6468,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-09-27 12:01:09","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":19749,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:01:16","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":466,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:01:16","func_code":"def square_perimeter(n):\n result = n * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":22171,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:01:16","func_code":"def rectangle_perimeter(n):\n result = 2 * n + n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":7468,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:01:16","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":20799,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:01:28","func_code":"def rectangle_perimeter(side):\n rectangle_perimeter = side + side + side + side\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":5579,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:01:28","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41532,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:01:28","func_code":"def circle_circumference(side):\n circle_circumference = side * 2 * 3.14\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":3634,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:01:28","func_code":"def square_perimeter(side):\n square_perimeter = side + side + side + side\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":35605,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:01:28","func_code":"def circle_area(side):\n circle_area = 3.14 * side * side\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":15986,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:01:33","func_code":"def rectangle_perimeter(n):\n square = n(n * n)\n return square","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":24286,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:01:33","func_code":"def circle_area(n):\n square = 3.14 + n + 2\n return square","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":13530,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:01:33","func_code":"def square_perimeter(n):\n square = n\n return square","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":39704,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:01:33","func_code":"def circle_circumference(n):\n square = (2)((3.1416)(n))\n return square","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":21687,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:01:33","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3603,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:34","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7642,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:34","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":2625,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:34","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":8081,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:34","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":13743,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:34","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":35744,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:34","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":27726,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:34","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":2105,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:34","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":16848,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:34","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":40560,"user":"edfafe89-fb39-4804-a616-a60af6a9fb7e","date":"2017-09-27 12:01:34","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36645,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2017-09-27 12:02:10","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":1997,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2017-09-27 12:02:10","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":14904,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2017-09-27 12:02:10","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":785,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:02:29","func_code":"def square_perimeter(side):\n square_perimeter = side + side + side + side\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30253,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:02:29","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7853,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:02:29","func_code":"def circle_circumference(side):\n circle_circumference = side * 2 * 3.14\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":42263,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:02:29","func_code":"def rectangle_perimeter(side):\n rectangle_perimeter = side + side + side + side\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":34244,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:02:29","func_code":"def circle_area(side):\n circle_area = 3.14 * side * side\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":40680,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:02:42","func_code":"def square_perimeter(n):\n square = n\n return square","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":17456,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:02:42","func_code":"def circle_circumference(n):\n square = 2 * (3.1416 * n)\n return square","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":3737,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:02:42","func_code":"def rectangle_perimeter(n):\n square = n(n * n)\n return square","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":12602,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:02:42","func_code":"def circle_area(n):\n square = 3.14 + n + 2\n return square","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":16726,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:02:42","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":14009,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:02:43","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":42472,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:02:43","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5756,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:03:16","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":34869,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:03:16","func_code":"def rectangle_perimeter(n):\n rec = n * n\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":37016,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:03:16","func_code":"def circle_circumference(n):\n c = n * 2\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":22911,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:03:16","func_code":"def circle_area(n):\n area = n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":32078,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:03:16","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35012,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:03:22","func_code":"def circle_area(n):\n square = (3.14 + n) ** 2\n return square","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":13290,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:03:22","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":22233,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:03:22","func_code":"def square_perimeter(n):\n square = n\n return square","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":11735,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:03:22","func_code":"def circle_circumference(n):\n square = 2 * (3.14 * n)\n return square","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":23988,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:03:22","func_code":"def rectangle_perimeter(n):\n square = n(n * n)\n return square","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":10076,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:03:46","func_code":"def square_perimeter(n):\n result = n * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":28939,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:03:46","func_code":"def rectangle_perimeter(n):\n result = 2 * n + n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":24554,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:03:46","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":24258,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:03:46","func_code":"def circle_area(n):\n result = 3.14 * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":11769,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:04:02","func_code":"def square_perimeter(side):\n square_perimeter = side + side + side + side\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5102,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:04:02","func_code":"def square_perimeter(side):\n square_perimeter = side + side + side + side\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":32277,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:04:02","func_code":"def rectangle_perimeter(length, width):\n rectangle_perimeter = length + length + width + width\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":32131,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:04:02","func_code":"def circle_circumference(side):\n circle_circumference = side * 2 * 3.14\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":29615,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:04:02","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":24537,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:04:02","func_code":"def circle_circumference(side):\n circle_circumference = side * 2 * 3.14\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":6998,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:04:02","func_code":"def circle_area(side):\n circle_area = 3.14 * side * side\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":18588,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:04:02","func_code":"def rectangle_perimeter(length, width):\n rectangle_perimeter = length + length + width + width\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":37781,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:04:02","func_code":"def circle_area(side):\n circle_area = 3.14 * side * side\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":31731,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-09-27 12:04:02","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37526,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:04:03","func_code":"def circle_circumference(n):\n square = 2 * (3.14 * n)\n return square","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":13391,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:04:03","func_code":"def circle_area(n):\n square = 3.14 * n ** 2\n return square","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":12735,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:04:03","func_code":"def rectangle_perimeter(n):\n square = n(n * n)\n return square","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":9832,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:04:03","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":24787,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:04:03","func_code":"def square_perimeter(n):\n square = n\n return square","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":11052,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:04:06","func_code":"def square_perimeter(side):\n peri = side * 4\n result = peri * peri\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":27359,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:04:06","func_code":"def rectangle_perimeter(l, h):\n result = l * 2 + h * h\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":13852,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:04:06","func_code":"def circle_area(radius):\n result = 3.14 * (radius * radius)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":12659,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:04:06","func_code":"def circle_circumference(radius):\n result = 3.14 * (radius * 2)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":15234,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:04:06","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41540,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:04:24","func_code":"def rectangle_perimeter(a, b):\n result = 2 * a * 2 * b\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":1882,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:04:24","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":29888,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:04:24","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9243,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:04:24","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":16044,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:04:24","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":32260,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:04:42","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":25668,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:04:42","func_code":"def rectangle_perimeter(side1, side2):\n return side1 + side2 + side2 + side2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":8070,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:04:42","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21504,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:04:42","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11694,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:05:02","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":32468,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:05:02","func_code":"def rectangle_perimeter(n):\n result = n + n + n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":30852,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:05:02","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":28138,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:05:02","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":16580,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:05:02","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":8093,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:05:11","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31905,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:05:11","func_code":"def circle_area(n):\n result = n * n * 3.141\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":40231,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:05:11","func_code":"def circle_circumference(n):\n result = 2 * 3.141 * 3\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":35301,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:05:11","func_code":"def square_perimeter(n):\n result = n * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":2580,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:05:11","func_code":"def rectangle_perimeter(n):\n result = n + n + n + n\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":11939,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 12:05:13","func_code":"def rectangle_perimeter(n, m):\n result = n * 2 + m * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":37181,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 12:05:13","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31961,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 12:05:13","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":28655,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 12:05:13","func_code":"def rectangle_perimeter(n, m):\n result = n * 2 + m * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":23722,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 12:05:13","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":12494,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 12:05:13","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":30578,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 12:05:13","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27389,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 12:05:13","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":36562,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 12:05:13","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":34222,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-09-27 12:05:13","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":33009,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:05:22","func_code":"def square_perimeter(n):\n square = n * 4\n return square","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":27725,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:05:22","func_code":"def circle_area(n):\n square = 3.14 * n ** 2\n return square","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":31006,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:05:22","func_code":"def circle_circumference(n):\n square = 2 * (3.14 * n)\n return square","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":41643,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:05:22","func_code":"def circle_area(n):\n square = 3.14 * n ** 2\n return square","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21517,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:05:22","func_code":"def rectangle_perimeter(n, m):\n square = n + n + m + m\n return square","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":5518,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:05:22","func_code":"def circle_circumference(n):\n square = 2 * (3.14 * n)\n return square","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":20279,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:05:22","func_code":"def square_perimeter(n):\n square = n * 4\n return square","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":14903,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:05:22","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39516,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:05:22","func_code":"def rectangle_perimeter(n, m):\n square = n + n + m + m\n return square","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":24051,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2017-09-27 12:05:22","func_code":"def square_area(n):\n square = n * n\n return square","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2924,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:05:49","func_code":"def circle_area(radius):\n result = 3.14 * (radius * radius)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":36846,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:05:49","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8102,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:05:49","func_code":"def rectangle_perimeter(l, h):\n result = l * 2 + h * h\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":1909,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:05:49","func_code":"def circle_circumference(radius):\n result = 3.14 * (radius * 2)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":19266,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:05:49","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":25759,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:05:58","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":25865,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:05:58","func_code":"def circle_circumference(n):\n c = n * 2\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":18106,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:05:58","func_code":"def rectangle_perimeter(n):\n rec = n * n\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":209,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:05:58","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7113,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:05:58","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":31455,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:06:14","func_code":"def circle_area(radius):\n result = radius * 3.14 * 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":17099,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:06:14","func_code":"def rectangle_perimeter(length, height):\n result = length + length + height + height\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":18197,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:06:14","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":23114,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:06:14","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33307,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:06:14","func_code":"def circle_circumference(diameter):\n result = diameter * 3.14 * 2\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":25106,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:06:21","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35699,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:06:21","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33192,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:06:21","func_code":"def rectangle_perimeter(l, h):\n result = l * 2 + h * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":794,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:06:21","func_code":"def circle_area(radius):\n result = 3.14 * (radius * radius)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":28988,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:06:21","func_code":"def rectangle_perimeter(l, h):\n result = l * 2 + h * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":26152,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:06:21","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22794,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:06:21","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":16392,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:06:21","func_code":"def circle_circumference(radius):\n result = 3.14 * (radius * 2)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":24265,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:06:21","func_code":"def circle_circumference(radius):\n result = 3.14 * (radius * 2)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":26473,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-09-27 12:06:21","func_code":"def circle_area(radius):\n result = 3.14 * (radius * radius)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":12581,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:06:38","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n result = x1 + y1 + x2 + y2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":723,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:06:38","func_code":"def circle_area(n):\n result = 3.14 * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":26918,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:06:38","func_code":"def square_perimeter(n):\n result = n * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":18258,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:06:38","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":34799,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:07:01","func_code":"def rectangle_perimeter(n):\n rec = n * n\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":23925,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:07:01","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":26576,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:07:01","func_code":"def circle_circumference(n):\n c = n * 2 * 3.14\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":25526,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:07:01","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":22614,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:07:01","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":16541,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:07:04","func_code":"def rectangle_perimeter(n):\n result = n1 * n2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":31701,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:07:04","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":26687,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:07:04","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":824,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:07:04","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":24361,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:07:04","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":1463,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:07:10","func_code":"def rectangle_perimeter(n, a):\n rp = n + n + a + a","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":24746,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:07:10","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":14329,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:07:10","func_code":"def circle_area(n, a):\n ca = 3.14 * n * a\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":39721,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:07:10","func_code":"def square_perimeter(n):\n sp = n + n + n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":32923,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:07:10","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":34683,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:07:24","func_code":"def square_perimeter(side):\n return side * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":23766,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:07:24","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41010,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:07:24","func_code":"def rectangle_perimeter(s1, s2):\n return s1 + s1 + s2 + s2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":30156,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:07:24","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":26375,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:07:28","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":7314,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:07:28","func_code":"def square_perimeter(n):\n result = n * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":42166,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:07:28","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n result = x1 + y1 + x2 + y2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":30622,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:07:28","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":14115,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:07:28","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":32897,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:07:28","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":10483,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:07:28","func_code":"def circle_area(n):\n result = 3.14 * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":24244,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:07:28","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":24586,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:07:29","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3927,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:07:29","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n * m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":16388,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:07:29","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":21890,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:07:29","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":28499,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:07:29","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":31845,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:07:42","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":24155,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:07:42","func_code":"def square_perimeter(n):\n perimeter = n + n\n return perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":13818,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:07:42","func_code":"def circle_area(n):\n circle = n * n\n return circle","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":8477,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:07:42","func_code":"def rectangle_perimeter(n):\n rectangle = n * n\n return retangle","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":37039,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:07:42","func_code":"def circle_circumference(n):\n circumference = n * n\n return circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":4157,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:08:06","func_code":"def rectangle_perimeter(n):\n rec = n + n + n + n\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":23842,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:08:06","func_code":"def circle_circumference(n):\n c = n * 2 * 3.14\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":40528,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:08:06","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":33715,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:08:06","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":23876,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:08:06","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4609,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:08:14","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4930,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:08:14","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":14960,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:08:14","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":8656,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:08:14","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":19742,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:08:14","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22197,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:08:14","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":17042,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:08:14","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":26794,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:08:14","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":3790,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:08:14","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5127,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-09-27 12:08:14","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":18501,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:08:44","func_code":"def square_area(n):\n side = n ** 2\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20973,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:08:44","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":3328,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:08:44","func_code":"def circle_area(n):\n ca = n * n * 3.14\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":19688,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:08:44","func_code":"def rectangle_perimeter(n):\n rp = sp * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":34622,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:08:44","func_code":"def square_perimeter(n):\n sp = n * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":24923,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:08:47","func_code":"def rectangle_perimeter(n, a):\n rp = n + n + a + a","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":3659,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:08:47","func_code":"def square_perimeter(n):\n sp = n + n + n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":19905,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:08:47","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20166,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:08:47","func_code":"def circle_area(n, a):\n ca = 3.14 * n * a\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":9254,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:08:47","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":24791,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:08:53","func_code":"def square_perimeter(n):\n sp = n + n + n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":7134,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:08:53","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29925,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:08:53","func_code":"def circle_area(n):\n ca = 3.14 * (n * n)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":54,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:08:53","func_code":"def rectangle_perimeter(n, m):\n rp = n + n + m + m\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":31722,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:09:30","func_code":"def rectangle_perimeter(length, height):\n result = length * 2 + height * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":39084,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:09:30","func_code":"def circle_circumference(diameter):\n result = 3.14 * (diameter * diameter)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":21624,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:09:30","func_code":"def circle_area(radius):\n result = 3.14 * (radius * radius)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":39419,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:09:30","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":17829,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:09:30","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":24135,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:09:32","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":5869,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:09:32","func_code":"def circle_circumference(n):\n result = 2 * (3.14 * n)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":10431,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:09:32","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":32737,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:09:32","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20700,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:09:32","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":16412,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:09:38","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9460,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:09:38","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36690,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:09:39","func_code":"def rectangle_perimeter(s1, s2):\n return s1 + s1 + s2 + s2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":34926,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:09:39","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":37451,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:09:39","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":15366,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:09:39","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26915,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:09:46","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n result = x1 + y1 + x2 + y2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":21738,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:09:46","func_code":"def square_perimeter(n):\n result = n * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":2220,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:09:46","func_code":"def circle_area(n):\n result = 3.14 * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":24283,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:09:46","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":41269,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:09:49","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9004,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:09:49","func_code":"def rectangle_perimeter(n):\n rec = n * 2 + n * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":25453,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:09:49","func_code":"def circle_circumference(n):\n c = n * 2 * 3.14\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":30076,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:09:49","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":28648,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:09:49","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":12144,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:09:52","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":24302,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:09:52","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":26109,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:09:52","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":23588,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:09:52","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":9466,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:09:52","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":13051,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:09:52","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5572,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:09:52","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":9029,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:09:52","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":20088,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:09:52","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3573,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2017-09-27 12:09:52","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":13315,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:09:57","func_code":"def square_perimeter(n):\n sp = n + n + n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":40605,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:09:57","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41767,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:09:57","func_code":"def circle_area(n):\n ca = 3.14 * (n \/ 2)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":37733,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:09:57","func_code":"def rectangle_perimeter(n, m):\n rp = n + n + m + m\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":441,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:10:18","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":23827,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:10:18","func_code":"def circle_area(n):\n result = 3.14 * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":39998,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:10:18","func_code":"def square_perimeter(n):\n result = n * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":26417,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:10:18","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n result = x1 + y1 + x2 + y2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":22887,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:10:18","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19940,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:10:20","func_code":"def circle_area(n, a):\n ca = 3.14 * n * a\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":5416,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:10:20","func_code":"def square_perimeter(n):\n sp = n + n + n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":34321,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:10:20","func_code":"def rectangle_perimeter(n, a):\n rp = n + n + a + a\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":7885,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:10:20","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30739,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:10:20","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":22439,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:10:31","func_code":"def rectangle_perimeter(n, x):\n rec = n * 2 + x * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":29066,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:10:31","func_code":"def circle_circumference(n):\n c = n * 2 * 3.14\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":3550,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:10:31","func_code":"def circle_circumference(n):\n c = n * 2 * 3.14\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":38328,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:10:31","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":8698,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:10:31","func_code":"def rectangle_perimeter(n, x):\n rec = n * 2 + x * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":15910,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:10:31","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9037,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:10:31","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31341,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:10:31","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":8949,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:10:31","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":34641,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-09-27 12:10:31","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20809,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:10:58","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30338,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:10:58","func_code":"def rectangle_perimeter(n):\n result = n * 4\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":16890,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:10:58","func_code":"def circle_circumference(n):\n result = 2 * 3.141 * 3\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":22391,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:10:58","func_code":"def circle_area(n):\n result = n * n * 3.141\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":34872,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:10:58","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16549,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:11:05","func_code":"def circle_area(s):\n return s * s * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":29675,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:11:05","func_code":"def circle_circumference(s):\n return 2 * 3.141 * s","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":23458,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:11:05","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":15379,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:11:05","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":14706,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:11:11","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":12258,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:11:11","func_code":"def square_perimeter(n):\n sp = n + n + n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":34837,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:11:11","func_code":"def circle_area(n, a):\n ca = 3.14 * n * a\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":37798,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:11:11","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":26378,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:11:11","func_code":"def rectangle_perimeter(n, a):\n rp = n + n + a + a\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":41865,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:19","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16511,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:22","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9946,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:22","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39936,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:27","func_code":"def circle_circumference(cc):\n cc = 2 * (3.14)(cc)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":42422,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:27","func_code":"def square_area(sa):\n sa = sa * sa\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4103,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:27","func_code":"def circle_area(ca):\n ca = (3.14)(ca * ca)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":7054,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:27","func_code":"def rectangle_perimeter(rp):\n rp = (2)(rp, rp)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":5533,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:27","func_code":"def square_perimeter(sp):\n sp = sp + sp + sp + sp\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":15128,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:11:30","func_code":"def rectangle_perimeter(n):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":24459,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:11:30","func_code":"def circle_circumference(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":30537,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:11:30","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10157,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:11:30","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":34024,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:11:30","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":15377,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:11:43","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":36516,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:11:43","func_code":"def circle_circumference(n):\n result = 2 * (3.14 * n)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":18730,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:11:43","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":7356,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:11:43","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21157,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:11:43","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":38415,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:11:43","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":37402,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:11:43","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27991,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:11:43","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30812,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:11:43","func_code":"def circle_circumference(n):\n result = 2 * (3.14 * n)\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":25403,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2017-09-27 12:11:43","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":20539,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:50","func_code":"def circle_circumference(cc):\n cc = 2 * (3.14)(cc)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":19403,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:50","func_code":"def rectangle_perimeter(rp):\n rp = (2)(rp, rp)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":14676,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:50","func_code":"def circle_area(ca):\n ca = (3.14)(ca * cb)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":21360,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:50","func_code":"def square_perimeter(sp):\n sp = sp + sp + sp + sp\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":9953,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:11:50","func_code":"def square_area(sa):\n sa = sa * sa\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9482,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:11:59","func_code":"def rectangle_perimeter(n, a):\n rp = n + n + a + a\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":6505,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:11:59","func_code":"def square_perimeter(n):\n sp = n + n + n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":39003,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:11:59","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":37690,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:11:59","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35756,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:11:59","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":40164,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:11:59","func_code":"def circle_area(n):\n result = n * n * 3.141\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":17028,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:11:59","func_code":"def circle_area(n, a):\n ca = 3.14 * n * a\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":31369,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:11:59","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25400,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:11:59","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":6696,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:11:59","func_code":"def circle_circumference(n):\n result = 2 * 3.141 * 3\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":17991,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:12:03","func_code":"def square_area(sa):\n sa = sa * sa\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9891,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:12:03","func_code":"def circle_area(ca, cb):\n ca = (3.14)(ca * cb)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":19232,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:12:03","func_code":"def rectangle_perimeter(rp):\n rp = (2)(rp, rp)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":15068,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:12:03","func_code":"def circle_circumference(cc):\n cc = 2 * (3.14)(cc)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":13193,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:12:03","func_code":"def square_perimeter(sp):\n sp = sp + sp + sp + sp\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":27110,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":18945,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5030,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def circle_area(radius):\n result = 3.14 * (radius * radius)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":18181,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def circle_circumference(radius):\n result = 2 * 3.14 * radius\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":7886,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":16416,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def circle_area(radius):\n result = 3.14 * (radius * radius)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":15305,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def circle_circumference(radius):\n result = 2 * 3.14 * radius\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":19458,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37253,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def rectangle_perimeter(length, height):\n result = length * 2 + height * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":4105,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def circle_area(radius):\n result = 3.14 * (radius * radius)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10887,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":18708,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20783,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def rectangle_perimeter(length, height):\n result = length * 2 + height * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":28942,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def circle_circumference(radius):\n result = 2 * 3.14 * radius\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":27130,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2017-09-27 12:12:13","func_code":"def rectangle_perimeter(length, height):\n result = length * 2 + height * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":35733,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:12:16","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":6850,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:12:16","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":39289,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:12:16","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":7320,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:12:16","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":14601,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:12:16","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":22046,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:12:16","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":8260,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:12:16","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":14143,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:12:16","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":3780,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:12:16","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":38785,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2017-09-27 12:12:16","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":1560,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:12:26","func_code":"def circle_circumference(r):\n cc = 2 * 3.14 * r\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":12355,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:12:26","func_code":"def circle_area(r):\n ca = r * r * 3.14\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":40104,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:12:26","func_code":"def square_perimeter(n):\n sp = n * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30423,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:12:26","func_code":"def square_area(n):\n side = n ** 2\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37593,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:12:26","func_code":"def rectangle_perimeter(n):\n rp = 2 * sp\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":20497,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:12:43","func_code":"def circle_area(ca, cb):\n ca = (3.14)(ca * cb)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":29463,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:12:43","func_code":"def circle_circumference(cc):\n cc = 2 * (3.14)(cc)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":7114,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:12:43","func_code":"def rectangle_perimeter(rp):\n rp = (2)(rp, rp)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":26387,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:12:43","func_code":"def square_perimeter(sp):\n sp = sp + sp + sp + sp\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":6566,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:12:43","func_code":"def square_area(a):\n sa = a * a\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25022,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:12:51","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":30678,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:12:51","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6002,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:12:51","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":40592,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:12:51","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":32905,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:12:51","func_code":"def rectangle_perimeter(n):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":40217,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:12:53","func_code":"def square_perimeter(n):\n sp = n * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":35536,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:12:53","func_code":"def circle_circumference(r):\n cc = 2 * 3.14 * r\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":5722,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:12:53","func_code":"def circle_area(r):\n ca = r * r * 3.14\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":27821,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:12:53","func_code":"def square_area(n):\n side = n ** 2\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":40331,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:12:53","func_code":"def rectangle_perimeter(n):\n rp = n * 4\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":16441,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:13:04","func_code":"def rectangle_perimeter(rp):\n rp = (2)(rp, rp)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":2956,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:13:04","func_code":"def circle_circumference(cc):\n cc = 2 * (3.14)(cc)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":3157,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:13:04","func_code":"def circle_area(ca, cb):\n ca = (3.14)(ca * cb)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":35799,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:13:04","func_code":"def square_area(a):\n sa = a * a\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4815,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:13:04","func_code":"def square_perimeter(b):\n sp = b + b + b + b\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":14943,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:13:09","func_code":"def rectangle_perimeter(n, a):\n rp = n + n + a + a\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":12635,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:13:09","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":39660,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:13:09","func_code":"def circle_area(n):\n ca = 3.14 * (n * n)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":12750,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:13:09","func_code":"def square_perimeter(n):\n sp = n * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":36030,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:13:09","func_code":"def rectangle_perimeter(n, a):\n rp = n + n + a + a\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":35465,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:13:09","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":3481,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:13:09","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":32852,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:13:09","func_code":"def circle_area(n):\n ca = 3.14 * (n * n)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":34543,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:13:09","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31566,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2017-09-27 12:13:09","func_code":"def square_perimeter(n):\n sp = n * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":10040,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 12:13:30","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21380,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 12:13:30","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":632,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 12:13:30","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11005,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 12:13:30","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":29988,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 12:13:30","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":38140,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 12:13:30","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":1691,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 12:13:30","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":22784,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 12:13:30","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":23062,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 12:13:30","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":3694,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2017-09-27 12:13:30","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":33801,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:13:41","func_code":"def circle_circumference(cc):\n cc = 2 * (3.14)(cc)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":37779,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:13:41","func_code":"def square_perimeter(b):\n sp = b + b + b + b\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":38955,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:13:41","func_code":"def rectangle_perimeter(rp):\n rp = (2)(rp, rp)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":6849,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:13:41","func_code":"def square_area(a):\n sa = a * a\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19440,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:13:41","func_code":"def circle_area(c):\n ca = (3.14)(c * c)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":28024,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:13:52","func_code":"def circle_area(n):\n result = 3.14 * (n + n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":2762,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:13:52","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36008,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:13:52","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":23202,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:13:52","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":41555,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:13:52","func_code":"def circle_circumference(n):\n result = 2 * 3.141 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":21993,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:14:07","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":5945,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:14:07","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":14192,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:14:07","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":39821,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:14:07","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":4125,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:14:07","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":3217,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:14:07","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19909,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:14:07","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33870,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:14:07","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":2272,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:14:07","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":6450,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-09-27 12:14:07","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":30591,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:14:10","func_code":"def circle_circumference(cc):\n cc = 2 * (3.14)(cc)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":3874,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:14:10","func_code":"def square_perimeter(b):\n sp = b + b + b + b\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":4575,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:14:10","func_code":"def rectangle_perimeter(rp):\n rp = (2)(rp, rp)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":26933,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:14:10","func_code":"def square_area(a):\n sa = a * a\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":803,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:14:10","func_code":"def circle_area(c):\n ca = (3.14)(c ** c)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":29522,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:22","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":29882,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:22","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36278,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:22","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":527,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:22","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22453,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:22","func_code":"def circle_circumference(n):\n result = 2 * 3.141 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":8724,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:14:23","func_code":"def square_perimeter(b):\n sp = b + b + b + b\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":6177,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:14:23","func_code":"def square_area(a):\n sa = a * a\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25052,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:14:23","func_code":"def circle_area(c):\n ca = (3.14)(c ** 2)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":12883,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:14:23","func_code":"def circle_circumference(cc):\n cc = 2 * (3.14)(cc)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":26246,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:14:23","func_code":"def rectangle_perimeter(rp):\n rp = (2)(rp, rp)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":10355,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:14:38","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":41576,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:14:38","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":31779,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:14:38","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":7420,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:14:38","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":24997,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:14:38","func_code":"def rectangle_perimeter(n):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":38628,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:41","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11562,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:41","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":13870,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:41","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":14476,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:41","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":25961,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:41","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":1318,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:41","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9176,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:41","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":38982,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:41","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":28756,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:41","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4385,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2017-09-27 12:14:41","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":38557,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-27 12:15:24","func_code":"def square_area(n):\n return n ** n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":16060,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:15:27","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":12081,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:15:27","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":26814,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:15:27","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":36855,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:15:27","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":13644,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:15:27","func_code":"def rectangle_perimeter(n):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":29547,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:15:29","func_code":"def square_perimeter(n):\n sqperim = 2 * (n + n)\n return sqperim","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":24393,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:15:29","func_code":"def rectangle_perimeter(n, m):\n recperim = 2 * (n, m)\n return recperim","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":13157,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:15:29","func_code":"def circle_circumference(n):\n circum = 2 * 3.14 * n\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":36451,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:15:29","func_code":"def circle_area(n):\n cirarea = 3.14 * n ** 2\n return cirarea","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":20635,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:15:29","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3014,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:15:37","func_code":"def square_perimeter(b):\n sp = b + b + b + b\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":38664,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:15:37","func_code":"def circle_circumference(cc):\n cc = 2 * (3.14)(cc)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":28046,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:15:37","func_code":"def circle_area(c):\n ca = 3.14 * c ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":8156,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:15:37","func_code":"def square_area(a):\n sa = a * a\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":32000,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:15:37","func_code":"def rectangle_perimeter(rp):\n rp = (2)(rp, rp)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":18914,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:01","func_code":"def rectangle_perimeter(rp):\n rp = (2)(rp, rp)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":40497,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:01","func_code":"def circle_circumference(d):\n cc = 2 * 3.14 * d\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":1340,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:01","func_code":"def circle_area(c):\n ca = 3.14 * c ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":30061,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:01","func_code":"def square_area(a):\n sa = a * a\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9678,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:01","func_code":"def square_perimeter(b):\n sp = b + b + b + b\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":19735,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:16:08","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":32069,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:16:08","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":37049,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:16:08","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":25760,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:16:08","func_code":"def circle_area(n):\n result = 3.14 * (n * n)\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":41901,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:16:08","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5797,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:16:08","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":29592,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:16:08","func_code":"def square_perimeter(n):\n result = 4 * n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":13178,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:16:08","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":12916,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:16:08","func_code":"def rectangle_perimeter(n, z):\n result = (n + z) * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":11695,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-09-27 12:16:08","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39123,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:16:18","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":37327,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:16:18","func_code":"def circle_area(n):\n ca = 3.14 * (n * n)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":41898,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:16:18","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":39600,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:16:18","func_code":"def circle_area(n):\n ca = 3.14 * (n * n)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":11039,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:16:18","func_code":"def rectangle_perimeter(n, m):\n rp = n * 2 + m * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":3012,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:16:18","func_code":"def square_perimeter(n):\n sp = n + n + n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":14830,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:16:18","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19513,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:16:18","func_code":"def rectangle_perimeter(n, m):\n rp = n * 2 + m * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":12954,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:16:18","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25399,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2017-09-27 12:16:18","func_code":"def square_perimeter(n):\n sp = n + n + n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5827,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:35","func_code":"def circle_circumference(d):\n cc = 2 * 3.14 * d\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":25891,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:35","func_code":"def circle_area(c):\n ca = 3.14 * c ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":6615,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:35","func_code":"def square_perimeter(b):\n sp = b + b + b + b\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":1862,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:35","func_code":"def square_area(a):\n sa = a * a\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":34680,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:35","func_code":"def rectangle_perimeter(e, f):\n rp = 2 * (e + f)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":1480,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:50","func_code":"def circle_area(c):\n ca = 3.14 * c ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":19338,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:50","func_code":"def square_perimeter(b):\n sp = b + b + b + b\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":6885,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:50","func_code":"def circle_circumference(d):\n cc = 2 * 3.14 * d\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":6497,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:50","func_code":"def circle_circumference(d):\n cc = 2 * 3.14 * d\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":6167,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:50","func_code":"def circle_area(c):\n ca = 3.14 * c ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":31091,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:50","func_code":"def square_area(a):\n sa = a * a\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8256,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:50","func_code":"def rectangle_perimeter(e, f):\n rp = 2 * (e + f)\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":32910,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:50","func_code":"def square_area(a):\n sa = a * a\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7069,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:50","func_code":"def rectangle_perimeter(e, f):\n rp = 2 * (e + f)\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":9225,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-09-27 12:16:50","func_code":"def square_perimeter(b):\n sp = b + b + b + b\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11001,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:16:57","func_code":"def circle_circumference(n):\n circum = 2 * 3.14 * n\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":24875,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:16:57","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35232,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:16:57","func_code":"def rectangle_perimeter(n, m):\n recperim = 2 * (n + m)\n return recperims","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":37073,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:16:57","func_code":"def circle_area(n):\n cirarea = 3.14 * n ** 2\n return cirarea","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":32479,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:16:57","func_code":"def square_perimeter(n):\n sqperim = 2 * (n + n)\n return sqperim","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":4922,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:17:31","func_code":"def circle_area(n):\n cirarea = 3.14 * n ** 2\n return cirarea","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":25737,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:17:31","func_code":"def circle_circumference(n):\n circum = 2 * 3.14 * n\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":22650,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:17:31","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9682,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:17:31","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5170,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:17:31","func_code":"def rectangle_perimeter(n, m):\n recperim = 2 * (n + m)\n return recperim","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":1833,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:17:31","func_code":"def circle_area(n):\n cirarea = 3.14 * n ** 2\n return cirarea","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":41642,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:17:31","func_code":"def square_perimeter(n):\n sqperim = 2 * (n + n)\n return sqperim","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30846,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:17:31","func_code":"def square_perimeter(n):\n sqperim = 2 * (n + n)\n return sqperim","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":34134,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:17:31","func_code":"def circle_circumference(n):\n circum = 2 * 3.14 * n\n return circum","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":24631,"user":"06043f63-bd06-4b6c-9b40-184b4eca2307","date":"2017-09-27 12:17:31","func_code":"def rectangle_perimeter(n, m):\n recperim = 2 * (n + m)\n return recperim","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":40070,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-27 12:18:14","func_code":"def square_area(n):\n return n ** n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":10141,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-27 12:18:14","func_code":"def square_area(n):\n return n ** n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":17529,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-27 12:18:14","func_code":"def square_area(n):\n return n ** n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":25000,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:19:10","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39671,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:19:10","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":24846,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:19:10","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30272,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:19:10","func_code":"def rectangle_perimeter(s1, s2):\n return s1 + s1 + s2 + s2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":7194,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:19:35","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":32079,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:19:35","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":35661,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:19:35","func_code":"def circle_circumference(s):\n return 2 * 3.14 * s","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":42443,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:19:35","func_code":"def circle_area(s):\n return s * s * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":23126,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:20:36","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16210,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:20:36","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":33889,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:20:36","func_code":"def circle_circumference(r):\n return 2 * 3.14 * r","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":14330,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:20:36","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":24591,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:20:36","func_code":"def rectangle_perimeter(l, w):\n return 2 * l + w","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":31603,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:21:20","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":23213,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:21:20","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":32386,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:21:20","func_code":"def rectangle_perimeter(l, w):\n return 2 * l + w","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":25674,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:21:20","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21307,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:21:20","func_code":"def circle_circumference(r):\n return 2 * 3.14 * r","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":698,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:21:33","func_code":"def rectangle_perimeter(s1, s2):\n return s1 + s1 + s2 + s2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":15289,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:21:33","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18095,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:21:33","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":24441,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:21:33","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":17451,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:22:24","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":42352,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:22:24","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11273,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:22:24","func_code":"def rectangle_perimeter(s1, s2):\n return s1 + s1 + s2 + s2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":25682,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:22:24","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":37345,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 12:22:44","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22846,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 12:22:44","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":7659,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 12:22:44","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":36540,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 12:22:44","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":22509,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 12:22:44","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":37156,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 12:22:44","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":40451,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 12:22:44","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5505,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 12:22:44","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":4612,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 12:22:44","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":9450,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2017-09-27 12:22:44","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":1706,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:23:07","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":28213,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:23:07","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":1931,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:23:07","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":40799,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:23:07","func_code":"def rectangle_perimeter(s1, s2):\n return s1 + s1 + s2 + s2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":14409,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:24:02","func_code":"def circle_area(radius):\n return radius * radius * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":6306,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:24:02","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":21211,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:24:02","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":34609,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:24:02","func_code":"def rectangle_perimeter(s1, s2):\n return s1 + s1 + s2 + s2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":28851,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:24:39","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":24647,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:24:39","func_code":"def circle_circumference(r):\n return 3.14 * r * 2","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":18705,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:24:39","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16313,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:24:39","func_code":"def rectangle_perimeter(l, w):\n return l + w * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":13368,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:24:39","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":14934,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:26:57","func_code":"def rectangle_perimeter(l, w):\n return l + w * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":23741,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:26:57","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":26935,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:26:57","func_code":"def circle_circumference(r):\n return 3.14 * r * 2","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":9034,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:26:57","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":41674,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:26:57","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":42336,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:27:27","func_code":"def circle_circumference(r):\n return 3.14 * r * 2","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":14567,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:27:27","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15626,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:27:27","func_code":"def rectangle_perimeter(l, w):\n return l + w + l + w","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":669,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:27:27","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21482,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:27:27","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":23317,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:27:27","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":2501,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:27:27","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":7477,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:27:27","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":40052,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:27:27","func_code":"def rectangle_perimeter(l, w):\n return l + w + l + w","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":16241,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-09-27 12:27:27","func_code":"def circle_circumference(r):\n return 3.14 * r * 2","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":6004,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:28:15","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":6692,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:28:15","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15154,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:28:15","func_code":"def circle_circumference(s):\n return 2 * 3.14 * s","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":3520,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:28:15","func_code":"def circle_area(s):\n return s * s * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":9378,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 12:29:23","func_code":"def rectangle_perimeter(l, w):\n return l + w + l + w","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":30706,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 12:29:23","func_code":"def circle_circumference(r):\n return 2 * 3.14 * r","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":36096,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 12:29:23","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31178,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 12:29:23","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":28512,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 12:29:23","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37889,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 12:29:23","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":36587,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 12:29:23","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":33638,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 12:29:23","func_code":"def rectangle_perimeter(l, w):\n return l + w + l + w","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":27728,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 12:29:23","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":26763,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-09-27 12:29:23","func_code":"def circle_circumference(r):\n return 2 * 3.14 * r","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":18566,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:30:07","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20092,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:30:07","func_code":"def circle_area(s):\n return s * s * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":27233,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:30:07","func_code":"def circle_circumference(s):\n return 2 * 3.14 * s","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":31533,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:30:07","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11657,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:31:29","func_code":"def circle_area(s):\n return s * s * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10050,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:31:29","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19972,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:31:29","func_code":"def circle_circumference(s):\n return 2 * 3.14 * s","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":20019,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:31:29","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":38164,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:28","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41501,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:28","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":37911,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:28","func_code":"def circle_circumference(r):\n return 2 * 3.14 * r","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":4771,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:28","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":29668,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:56","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":11982,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:56","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18700,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:56","func_code":"def square_area(n):\n return n ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17246,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:56","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":25741,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:56","func_code":"def circle_circumference(r):\n return 2 * 3.14 * r","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":29516,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:56","func_code":"def circle_circumference(r):\n return 2 * 3.14 * r","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":25979,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:56","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":33368,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:56","func_code":"def rectangle_perimeter(l, w):\n return l + w + l + w","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":5092,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:56","func_code":"def rectangle_perimeter(l, w):\n return l + w + l + w","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":30993,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2017-09-27 12:32:56","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":27200,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:34:05","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17922,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:34:05","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29147,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:34:13","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":24795,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:34:13","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16596,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:34:13","func_code":"def circle_area(radius):\n return radius * radius * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":26615,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:34:13","func_code":"def rectangle_perimeter(s1, s2):\n return s1 + s1 + s2 + s2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":39518,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:34:13","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":15090,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:34:13","func_code":"def rectangle_perimeter(s1, s2):\n return s1 + s1 + s2 + s2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":14332,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:34:13","func_code":"def circle_area(radius):\n return radius * radius * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":28965,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-09-27 12:34:13","func_code":"def square_perimeter(side):\n return side + side + side + side","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":37740,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:29:52","func_code":"def square_area(a):\n return a * a","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":38489,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:29:52","func_code":"def square_area(a):\n return a * a","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16683,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:36:52","func_code":"def rectangle_perimeter(x, y):\n result = x + y + x + y\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":7891,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:36:52","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8579,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:36:52","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11995,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:36:52","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":41140,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:38:23","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":14033,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:38:23","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":38335,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:38:23","func_code":"def rectangle_perimeter(x, y):\n result = x + y + x + y\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":18295,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:38:23","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27129,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:08","func_code":"def rectangle_perimeter(x, y):\n result = x + y + x + y\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":23056,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:08","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":14060,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:08","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19322,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:08","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":31919,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:27","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10500,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:27","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8397,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:27","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":42113,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:27","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":10301,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:27","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":33880,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:27","func_code":"def rectangle_perimeter(x, y):\n result = x + y + x + y\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":3733,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:27","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4069,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:27","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22062,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:27","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":5096,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-27 13:39:27","func_code":"def rectangle_perimeter(x, y):\n result = x + y + x + y\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":11062,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:40:11","func_code":"def circle_area(a):\n return 3.14 * (a \/ 2) ** 2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":21527,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:40:11","func_code":"def rectangle_perimeter(a, b):\n return 2 * a * (2 * b)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":4504,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:40:11","func_code":"def circle_circumference(a):\n return a * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":35831,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:40:11","func_code":"def square_perimeter(a):\n return 4 * a","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":42007,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:40:11","func_code":"def square_area(a):\n return a * a","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8382,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:41:48","func_code":"def square_area(a):\n return a * a","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36165,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:41:48","func_code":"def square_perimeter(a):\n return 4 * a","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":14504,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:41:48","func_code":"def circle_area(a):\n return 3.14 * (a \/ 2) ** 2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":20377,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:41:48","func_code":"def circle_circumference(a):\n return a * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":1795,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 13:41:48","func_code":"def rectangle_perimeter(a, b):\n return 2 * a * (2 * b)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":16064,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 15:03:08","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13333,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 15:03:27","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20573,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:06:23","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":32452,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:06:23","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":32671,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-09-27 16:12:54","func_code":"def perimeter(n):\n per = n * 4\n return per\n\n\ndef rectangle_perimeter(n, m):\n rec = n * 2 + m * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":19134,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-09-27 16:12:54","func_code":"def perimeter(n):\n per = n * 4\n return per\n\n\ndef rectangle_perimeter(n, m):\n rec = n * 2 + m * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":42307,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-09-27 16:12:54","func_code":"def perimeter(n):\n per = n * 4\n return per\n\n\ndef rectangle_perimeter(n, m):\n rec = n * 2 + m * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":42066,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-09-27 16:12:54","func_code":"def circle_area(n):\n circ = 3.14 * (n * n)\n return circ","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":41811,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-09-27 16:12:54","func_code":"def circle_circumference(n):\n circle = 2 * 3.14 * n\n return circle","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":40929,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-09-27 16:12:54","func_code":"def circle_circumference(n):\n circle = 2 * 3.14 * n\n return circle","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":29842,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-09-27 16:12:54","func_code":"def circle_area(n):\n circ = 3.14 * (n * n)\n return circ","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":11765,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-09-27 16:12:54","func_code":"def circle_area(n):\n circ = 3.14 * (n * n)\n return circ","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10270,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-09-27 16:12:54","func_code":"def circle_circumference(n):\n circle = 2 * 3.14 * n\n return circle","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":39137,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:18:42","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":760,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:24:35","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7379,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:32:21","func_code":"def square_area(n):\n sq = n * 4\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":17635,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:32:50","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17676,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:37:12","func_code":"def rectangle_perimeter(a, b):\n return 2 * a * (2 * b)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":11302,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:37:12","func_code":"def square_perimeter(a):\n return 4 * a","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":32061,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:37:12","func_code":"def circle_area(a):\n return 3.14 * a ** 2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":1955,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:37:12","func_code":"def square_area(a):\n return a * a","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2106,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:37:12","func_code":"def circle_circumference(a):\n return a * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":15280,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:38:03","func_code":"def square_area(a):\n return a * a","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27468,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:38:03","func_code":"def circle_area(a):\n return 3.14 * a ** 2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":40197,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:38:03","func_code":"def square_perimeter(a):\n return 4 * a","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":19641,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:38:03","func_code":"def square_area(a):\n return a * a","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27353,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:38:03","func_code":"def circle_area(a):\n return 3.14 * a ** 2","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":3508,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:38:03","func_code":"def circle_circumference(a):\n return a * 3.14 * 2","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":8820,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:38:03","func_code":"def circle_circumference(a):\n return a * 3.14 * 2","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":18929,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:38:03","func_code":"def square_perimeter(a):\n return 4 * a","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5298,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:38:03","func_code":"def rectangle_perimeter(a, b):\n return 2 * a + 2 * b","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":40868,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-09-27 16:38:03","func_code":"def rectangle_perimeter(a, b):\n return 2 * a + 2 * b","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":25945,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:42:21","func_code":"def square_perimeter(a):\n p = a * 4\n return p","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":27362,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:42:21","func_code":"def circle_circumference(d):\n cc = 2 * 3.14 * d\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":32034,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:42:21","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39412,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:42:21","func_code":"def rectangle_perimeter(b):\n pr = b * 4\n return pr","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":1329,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:42:21","func_code":"def circle_area(c):\n ca = 3.14 * (c * c)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":34649,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:43:47","func_code":"def circle_area(c):\n ca = 3.14 * (c * c)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":38051,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:43:47","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":24715,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:43:47","func_code":"def circle_circumference(d):\n cc = 2 * 3.14 * d\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":42227,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:43:47","func_code":"def square_perimeter(a):\n p = a * 4\n return p","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":15315,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:43:47","func_code":"def rectangle_perimeter(b, x):\n pr = b * x\n return pr","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":1019,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27653,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def rectangle_perimeter(b, x):\n pr = b * 2 + x * 2\n return pr","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":28230,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18795,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def rectangle_perimeter(b, x):\n pr = b * 2 + x * 2\n return pr","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":1948,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def circle_area(c):\n ca = 3.14 * (c * c)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":19724,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def circle_area(c):\n ca = 3.14 * (c * c)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":38700,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def circle_circumference(d):\n cc = 2 * 3.14 * d\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":18327,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def square_perimeter(a):\n p = a * 4\n return p","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":2303,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def circle_area(c):\n ca = 3.14 * (c * c)\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":3785,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def rectangle_perimeter(b, x):\n pr = b * 2 + x * 2\n return pr","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":39656,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def circle_circumference(d):\n cc = 2 * 3.14 * d\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":39427,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def square_perimeter(a):\n p = a * 4\n return p","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":29235,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def circle_circumference(d):\n cc = 2 * 3.14 * d\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":21342,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def square_perimeter(a):\n p = a * 4\n return p","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":40275,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-09-27 16:44:51","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":40184,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:24:02","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11810,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:24:02","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3291,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:39:01","func_code":"def rectangle_perimeter(a, b):\n a = a * 2 + b * 2\n return a","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":25921,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:39:01","func_code":"def square_perimeter(n):\n sq = n * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":40129,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:39:01","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":15828,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:39:01","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":22070,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:45:56","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":1313,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:45:56","func_code":"def square_perimeter(n):\n sq = n * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":31432,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:45:56","func_code":"def rectangle_perimeter(a, b):\n a = a * 2 + b * 2\n return a","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":28020,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:45:56","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":14365,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:01","func_code":"def square_area(n):\n sq = n * 4\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":21039,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:01","func_code":"def square_perimeter(n):\n sq = n * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":13380,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:01","func_code":"def rectangle_perimeter(a, b):\n a = a * 2 + b * 2\n return a","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":10736,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:01","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":28898,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:01","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":3113,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:13","func_code":"def square_perimeter(n):\n sq = n * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":2792,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:13","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":31276,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:13","func_code":"def rectangle_perimeter(a, b):\n a = a * 2 + b * 2\n return a","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":21754,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:13","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16825,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:13","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":31097,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:18","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":38775,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:18","func_code":"def rectangle_perimeter(a, b):\n a = a * 2 + b * 2\n return a","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":6005,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:18","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":9956,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:18","func_code":"def square_perimeter(n):\n sq = n * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":37697,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:18","func_code":"def rectangle_perimeter(a, b):\n a = a * 2 + b * 2\n return a","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":41515,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:18","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":24897,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:18","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":1664,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:18","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":11540,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:18","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2572,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-09-28 11:47:18","func_code":"def square_perimeter(n):\n sq = n * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":31101,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 13:47:08","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35199,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 13:47:08","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4591,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:15:59","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":38199,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:15:59","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35195,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:18:13","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25819,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:18:13","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31113,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:21:05","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7812,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:21:05","func_code":"def circle_circumference(radius):\n result = radius * 6.28\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":41066,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:21:05","func_code":"def circle_area(radius):\n result = radius * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":29260,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:21:05","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":17081,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:21:05","func_code":"def rectangle_perimeter(lenght, height):\n result = lenght * 2 + height * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":13849,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:21:33","func_code":"def circle_area(n):\n return n * n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":8109,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:21:33","func_code":"def square_perimeter(n):\n return n * n","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":16071,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:21:33","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27571,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:21:33","func_code":"def rectangle_perimeter(n):\n return n * n","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":36527,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:23:27","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":9223,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:23:27","func_code":"def rectangle_perimeter(lenght, height):\n result = lenght * 2 + height * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":19833,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:23:27","func_code":"def circle_circumference(radius):\n result = 2 * 3.14 * radius\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":18545,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:23:27","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":24181,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:23:27","func_code":"def circle_area(radius):\n result = radius * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":29033,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def circle_area(radius):\n result = radius * radius * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":7250,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def rectangle_perimeter(lenght, height):\n result = lenght * 2 + height * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":34745,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def circle_circumference(radius):\n result = 2 * 3.14 * radius\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":4925,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":28116,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def rectangle_perimeter(lenght, height):\n result = lenght * 2 + height * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":33436,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39644,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def square_area(side):\n result = side * side\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8115,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22153,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11604,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def circle_area(radius):\n result = radius * radius * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10740,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def rectangle_perimeter(lenght, height):\n result = lenght * 2 + height * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":15349,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def circle_area(radius):\n result = radius * radius * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":19977,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def circle_circumference(radius):\n result = 2 * 3.14 * radius\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":4940,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def square_perimeter(side):\n result = side * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20695,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2017-09-28 14:24:08","func_code":"def circle_circumference(radius):\n result = 2 * 3.14 * radius\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":7955,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:25:49","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25184,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:25:49","func_code":"def circle_area(n):\n return n * n * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":5948,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:25:49","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n return x1 + y1 + x2 + y2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":17757,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:25:49","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":4495,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:27:00","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18411,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:27:00","func_code":"def circle_circumference(n):\n return n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":15895,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:27:00","func_code":"def circle_area(n):\n return n * n * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":5394,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:27:00","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":19139,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:27:00","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n return x1 + y1 + x2 + y2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":10845,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:27:33","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n return x1 + y1 + x2 + y2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":31920,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:27:33","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":12097,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:27:33","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":7073,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:27:33","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11732,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:27:43","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":5374,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:27:43","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17871,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:27:43","func_code":"def circle_circumference(n):\n return n","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":902,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:27:43","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":33298,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:27:43","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n return x1 + y1 + x2 + y2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":16173,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:27:52","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":13637,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:27:52","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19720,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:27:52","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n return x1 + y1 + x2 + y2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":35092,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:27:52","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":16622,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:29:09","func_code":"def circle_circumference(n):\n return n \/ (2 * 3.14)","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":22151,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:29:09","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9234,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:29:09","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":2245,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:29:09","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":22010,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:29:09","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n return x1 + y1 + x2 + y2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":29416,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:30:15","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":23604,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:30:15","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":29378,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:30:15","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":32065,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:30:15","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n return x1 + y1 + x2 + y2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":21858,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:30:17","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":28990,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:30:17","func_code":"def circle_circumference(n):\n return n * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":42043,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:30:17","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n return x1 + y1 + x2 + y2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":21437,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:30:17","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":3347,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:30:17","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26430,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:30:51","func_code":"def rectangle_perimeter(x1, y1):\n return x1 + y1","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":24828,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:30:51","func_code":"def circle_circumference(n):\n return n * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":35159,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:30:51","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":35886,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:30:51","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":35480,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:30:51","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":15701,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:31:42","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26205,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:31:42","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":22888,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:31:42","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":6390,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:31:42","func_code":"def rectangle_perimeter(x1, y1):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":21854,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:31:42","func_code":"def rectangle_perimeter(x1, y1):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":25381,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:31:42","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5457,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:31:42","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":5954,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:31:42","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":18331,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:31:42","func_code":"def circle_circumference(n):\n return n * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":36679,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-09-28 14:31:42","func_code":"def circle_circumference(n):\n return n * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":26683,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:32:37","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5343,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:32:37","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20132,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:32:37","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":19554,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:32:37","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":40675,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:10","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":29200,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:10","func_code":"def rectangle_perimeter(x1, y1, x2, y2):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":34352,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:10","func_code":"def circle_circumference(n):\n return n * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":17981,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:10","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":32914,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:10","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":18412,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:34","func_code":"def circle_circumference(n):\n return n * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":16382,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:34","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":30600,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:34","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":25385,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:34","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":23815,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:34","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":28570,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:34","func_code":"def rectangle_perimeter(x1, y1):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":17837,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:34","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15752,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:34","func_code":"def rectangle_perimeter(x1, y1):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":40673,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:34","func_code":"def circle_circumference(n):\n return n * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":26435,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-09-28 14:34:34","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":34808,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:17:00","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37891,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:17:00","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":23701,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:25:47","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":13922,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:25:47","func_code":"def circle_area(r):\n a = r * r * 3.14\n return n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":27347,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:25:47","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4999,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:26:29","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":10676,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:26:29","func_code":"def circle_area(r):\n a = r * r * 3.14\n return n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":16492,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:26:29","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":15802,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:28:30","func_code":"def circle_area(r):\n a = r * r * 3.14\n return n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":37421,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:28:30","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":33626,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:28:30","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30390,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:29:10","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":20920,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:29:10","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21748,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:29:10","func_code":"def circle_area(r):\n a = r * r * 3.14\n return n","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":9657,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:29:38","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":12454,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:29:38","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":7699,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:29:38","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":11521,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:30:43","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21117,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:30:43","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":12816,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:30:43","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26161,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:30:43","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5037,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:30:43","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":20887,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-09-28 17:30:43","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":41627,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:12:19","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":34766,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:12:19","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":12667,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:23:14","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41294,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:23:14","func_code":"def circle_area(r):\n cra = (3.14 * r) ** 2\n return cra","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":34181,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:23:14","func_code":"def rectangle_perimeter(a, b):\n rp = a * 2 + b * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":17761,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:23:14","func_code":"def circle_circumference(r):\n cc = (2)(3.14 * r)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":42280,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:23:14","func_code":"def square_perimeter(a, b):\n sqp = a * 2 + b * 2\n return sqp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":29726,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:23:52","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21411,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:23:52","func_code":"def rectangle_perimeter(a, b):\n rp = a * 2 + b * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":1163,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:23:52","func_code":"def circle_circumference(r):\n cc = (2)(3.14 * r)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":19998,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:23:52","func_code":"def circle_area(r):\n cra = (3.14 * r) ** 2\n return cra","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":39013,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:23:52","func_code":"def square_perimeter(a, b):\n sqp = a * 2 + b * 2\n return sqp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":16397,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:25:14","func_code":"def circle_area(r):\n cra = r * r * 3.14\n return cra","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":8274,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:25:14","func_code":"def circle_circumference(r):\n cc = (2)(3.14 * r)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":30839,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:25:14","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5758,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:25:14","func_code":"def rectangle_perimeter(a, b):\n rp = a * 2 + b * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":33243,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:25:14","func_code":"def square_perimeter(a, b):\n sqp = a * 2 + b * 2\n return sqp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":34202,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:25:46","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36646,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:25:46","func_code":"def circle_circumference(r):\n cc = (2)(3.14 * r)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":27124,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:25:46","func_code":"def rectangle_perimeter(a, b):\n rp = a * 2 + b * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":4933,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:25:46","func_code":"def square_perimeter(a, b):\n sqp = a * 2 + b * 2\n return sqp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":33,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:25:46","func_code":"def circle_area(r):\n cra = r * r * 3.14\n return cra","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":36246,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:26","func_code":"def rectangle_perimeter(a, b):\n rp = a * 2 + b * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":11874,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:26","func_code":"def square_perimeter(a):\n sqp = a * 4\n return sqp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":1962,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:26","func_code":"def circle_circumference(r):\n cc = (2)(3.14 * r)\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":13642,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:26","func_code":"def circle_area(r):\n cra = r * r * 3.14\n return cra","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":1123,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:26","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3755,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def circle_circumference(r):\n cc = 2 * 3.14 * r\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":19611,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def circle_circumference(r):\n cc = 2 * 3.14 * r\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":16143,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18370,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def rectangle_perimeter(a, b):\n rp = a * 2 + b * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":6385,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def circle_area(r):\n cra = r * r * 3.14\n return cra","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":36142,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def circle_area(r):\n cra = r * r * 3.14\n return cra","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":2385,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def rectangle_perimeter(a, b):\n rp = a * 2 + b * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":7065,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def rectangle_perimeter(a, b):\n rp = a * 2 + b * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":28420,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def square_perimeter(a):\n sqp = a * 4\n return sqp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":33330,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":32975,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29464,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def circle_area(r):\n cra = r * r * 3.14\n return cra","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":27882,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def square_perimeter(a):\n sqp = a * 4\n return sqp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":10008,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def circle_circumference(r):\n cc = 2 * 3.14 * r\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":5915,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-09-28 18:26:56","func_code":"def square_perimeter(a):\n sqp = a * 4\n return sqp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":41503,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:22:15","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2845,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:22:15","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25616,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:30:09","func_code":"def circle_area(n):\n result = n ** 2 * math.pi\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":39519,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:30:09","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":17618,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:42:04","func_code":"def circle_circumference(n):\n result = 2 * PI * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":2735,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:42:04","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":38427,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:42:04","func_code":"def rectangle_perimeter(length, width):\n result = 2 * (length + width)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":27113,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:42:04","func_code":"def circle_area(n):\n result = PI * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":25444,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:42:27","func_code":"def circle_area(n):\n result = PI * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":39951,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:42:27","func_code":"def circle_circumference(n):\n result = 2 * PI * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":13564,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:42:27","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":6384,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:42:27","func_code":"def rectangle_perimeter(length, width):\n result = 2 * (length + width)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":28555,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:43:06","func_code":"def circle_circumference(n):\n result = 2 * PI * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":6059,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:43:06","func_code":"def circle_area(n):\n result = PI * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":18983,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:43:06","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27111,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:43:06","func_code":"def rectangle_perimeter(length, width):\n result = 2 * (length + width)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":8811,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:43:06","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":25060,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:43:53","func_code":"def circle_area(n):\n result = PI * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":19025,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:43:53","func_code":"def circle_circumference(n):\n result = 2 * PI * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":15994,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:43:53","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":42134,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:43:53","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":1236,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:43:53","func_code":"def rectangle_perimeter(length, width):\n result = 2 * (length + width)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":27303,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:44:22","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":13613,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:44:22","func_code":"def circle_area(n):\n result = PI * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":24161,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:44:22","func_code":"def rectangle_perimeter(length, width):\n result = 2 * (length + width)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":17033,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:44:22","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15241,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:44:22","func_code":"def circle_area(n):\n result = PI * n * n\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":7096,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:44:22","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5755,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:44:22","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30169,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:44:22","func_code":"def circle_circumference(n):\n result = 2 * PI * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":13946,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:44:22","func_code":"def circle_circumference(n):\n result = 2 * PI * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":39472,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2017-09-29 11:44:22","func_code":"def rectangle_perimeter(length, width):\n result = 2 * (length + width)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":6299,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-30 14:46:49","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20806,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-09-30 14:46:49","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27818,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-15 14:27:04","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n x = i\n y = i + 1\n while y < len(a):\n if a[y] < a[x]:\n x = y\n y = y + 1\n return x\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":20800,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-15 14:36:27","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n y = 1\n while y < len(a):\n y = y + 1\n return y\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n y = find_position_of_smallest(a, i)\n swap(a, i, y)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":37687,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-15 14:37:22","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n x = i\n y = i + 1\n while y < len(a):\n if a[y] < a[x]:\n x = y\n y = y + 1\n return x\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":25112,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-15 14:45:24","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n x = i\n y = i + 1\n while y < len(a):\n if a[y] < a[x]:\n x = y\n y = y + 1\n return x\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":4433,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-15 14:45:24","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n x = i\n y = i + 1\n while y < len(a):\n if a[y] < a[x]:\n x = y\n y = y + 1\n return x\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":6813,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-17 13:26:00","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while y < len(a):\n if a[i] < a[s]:\n s = i\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n s = find_position_of_smallest(a, i)\n swap(a, i, s)\n i = i + 1\n return s","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":11290,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-17 13:26:55","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n s = i\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n s = find_position_of_smallest(a, i)\n swap(a, i, s)\n i = i + 1\n return s","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":39876,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-17 13:26:55","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n s = i\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n s = find_position_of_smallest(a, i)\n swap(a, i, s)\n i = i + 1\n return s","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":33734,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-17 13:26:55","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n s = i\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n s = find_position_of_smallest(a, i)\n swap(a, i, s)\n i = i + 1\n return s","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":23594,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-10-17 17:38:56","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18644,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-10-17 17:38:56","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17742,"user":"9a568c0c-092c-425d-a47b-c4beebe03754","date":"2017-10-17 17:38:56","func_code":"def square_area(side):\n return side * side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20158,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:50:38","func_code":"def circle_circumference(c):\n cc = c * 3.14 * 2\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":13105,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:50:38","func_code":"def square_perimeter(a):\n sp = a * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11608,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:50:38","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2994,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:50:38","func_code":"def circle_area(b):\n ca = b * 3.14 * 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":37478,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:50:38","func_code":"def rectangle_perimeter(d, e):\n rp = d * 2 + e * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":18190,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:56:44","func_code":"def square_perimeter(a):\n sp = a * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":35722,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:56:44","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":11342,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:56:44","func_code":"def circle_area(b):\n ca = (b * 3.14) ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":10907,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:56:44","func_code":"def rectangle_perimeter(d, e):\n rp = d * 2 + e * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":5989,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:56:44","func_code":"def circle_circumference(c):\n cc = c * 3.14 * 2\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":29368,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:57:55","func_code":"def circle_circumference(c):\n cc = c * 3.14 * 2\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":16170,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:57:55","func_code":"def circle_area(b):\n ca = b * 3.14 * 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":5145,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:57:55","func_code":"def square_perimeter(a):\n sp = a * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20837,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:57:55","func_code":"def rectangle_perimeter(d, e):\n rp = d * 2 + e * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":8032,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:57:55","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":34424,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:58:58","func_code":"def square_perimeter(a):\n sp = a * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":23195,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:58:58","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16724,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:58:58","func_code":"def circle_area(b):\n ca = (b * 3.14) ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":28277,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:58:58","func_code":"def circle_circumference(c):\n cc = c * 3.14 * 2\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":7603,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:58:58","func_code":"def rectangle_perimeter(d, e):\n rp = d * 2 + e * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":27816,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:21","func_code":"def circle_area(b):\n ca = b * 3.14 * 3\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":36847,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:21","func_code":"def rectangle_perimeter(d, e):\n rp = d * 2 + e * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":29611,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:21","func_code":"def square_perimeter(a):\n sp = a * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":6579,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:21","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":38743,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:21","func_code":"def circle_circumference(c):\n cc = c * 3.14 * 2\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":47,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:36","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26021,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:36","func_code":"def circle_circumference(c):\n cc = c * 3.14 * 2\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":37635,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:36","func_code":"def rectangle_perimeter(d, e):\n rp = d * 2 + e * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":10765,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:36","func_code":"def circle_area(b):\n ca = b * 3.14 * 4\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":20099,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:36","func_code":"def square_perimeter(a):\n sp = a * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":19533,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:49","func_code":"def square_perimeter(a):\n sp = a * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20524,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:49","func_code":"def circle_circumference(c):\n cc = c * 3.14 * 2\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":26952,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:49","func_code":"def circle_circumference(c):\n cc = c * 3.14 * 2\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":22287,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:49","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":40401,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:49","func_code":"def rectangle_perimeter(d, e):\n rp = d * 2 + e * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":29567,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:49","func_code":"def square_perimeter(a):\n sp = a * 4\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":33595,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:49","func_code":"def circle_area(b):\n ca = b * 3.14 * b\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":24698,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:49","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2689,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:49","func_code":"def rectangle_perimeter(d, e):\n rp = d * 2 + e * 2\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":16046,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-18 10:59:49","func_code":"def circle_area(b):\n ca = b * 3.14 * b\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":9412,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:24:53","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":9009,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:24:53","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41944,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:24:53","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":3236,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:26:20","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":31480,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:26:20","func_code":"def rectangle_perimeter(a, b):\n a = a * 2 + b * 2\n return a","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":5135,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:26:20","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27648,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:26:20","func_code":"def rectangle_perimeter(a, b):\n a = a * 2 + b * 2\n return a","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":27569,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:26:20","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":21650,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:26:20","func_code":"def circle_area(r):\n a = r * r * 3.14\n return a","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":12222,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:26:20","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":22838,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:26:20","func_code":"def square_perimeter(n):\n sq = n * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":2153,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:26:20","func_code":"def square_perimeter(n):\n sq = n * 4\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":38333,"user":"21400f11-d7d5-41f5-a598-f62ff2831402","date":"2017-10-18 21:26:20","func_code":"def circle_circumference(r):\n c = 2 * 3.14 * r\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":19535,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-19 00:27:30","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, i, p)\n i += 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":22421,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-19 00:27:30","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, i, p)\n i += 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":391,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2017-10-19 00:27:30","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, i, p)\n i += 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":7315,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 11:59:29","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41660,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 11:59:29","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37026,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:08:55","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27112,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:08:55","func_code":"def rectangle_perimeter(a, b):\n result = 2 * (a + b)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":18168,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:08:55","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":26464,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:08:55","func_code":"def circle_area(n):\n result = n * n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":20331,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:10:47","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":1534,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:10:47","func_code":"def circle_area(n):\n result = n ** n * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":18476,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:10:47","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":11702,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:10:47","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":29894,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:12:07","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":7418,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:12:07","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":1982,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:12:07","func_code":"def circle_area(n):\n result = n ** 2 * 3.14\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":32686,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:12:07","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17662,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:13:07","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21405,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:13:07","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":17764,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:13:07","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":10910,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:13:07","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":35735,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:13:39","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":3551,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:13:39","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":19227,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:13:39","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":9098,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:13:39","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33448,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-10-19 12:14:23","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":34875,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-10-19 12:14:23","func_code":"def rectangle_perimeter(a, b):\n result = a * 2 + b * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":7958,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-10-19 12:14:23","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33946,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-10-19 12:14:23","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":22143,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-10-19 12:14:23","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":34642,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-10-19 12:14:23","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":14272,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-10-19 12:14:23","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":29096,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-10-19 12:14:23","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":15499,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-10-19 12:14:23","func_code":"def rectangle_perimeter(a, b):\n result = a * 2 + b * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":27205,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-10-19 12:14:23","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":29460,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:15:16","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9149,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:15:16","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":17184,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:15:16","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":29231,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:15:16","func_code":"def rectangle_perimeter(n, m):\n result = 2 * n * 2 * m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":4635,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:15:41","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":3719,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:15:41","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16822,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:15:41","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":40102,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:15:41","func_code":"def rectangle_perimeter(n, m):\n result = 2 * n * 2 * m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":18952,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:09","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":21243,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:09","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":28774,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:09","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":34815,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:09","func_code":"def rectangle_perimeter(n, m):\n result = 2 * n * 2 * m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":17323,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:09","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":2335,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:49","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":4982,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:49","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33895,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:49","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":12525,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:49","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":744,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:49","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":19146,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:49","func_code":"def square_perimeter(n):\n result = n * 4\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":37508,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:49","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":23628,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:49","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":26419,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:49","func_code":"def rectangle_perimeter(n, m):\n result = m * 2 + n * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":42115,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2017-10-19 12:16:49","func_code":"def rectangle_perimeter(n, m):\n result = m * 2 + n * 2\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":41970,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-10-19 13:41:19","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":28237,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-10-19 13:43:33","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":24855,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-10-19 13:43:33","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":7861,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-10-19 13:43:33","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":708,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:43:59","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7537,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:43:59","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33041,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:56:52","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":12414,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:56:52","func_code":"def square_perimeter(n):\n sp = n + n + n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":21533,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:56:52","func_code":"def rectangle_perimeter(n, a):\n rp = n + n + a + a\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":910,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:56:52","func_code":"def circle_circumference(r):\n cc = 2 * 3.14 * r\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":2982,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:56:52","func_code":"def circle_circumference(r):\n cc = 2 * 3.14 * r\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":8666,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:56:52","func_code":"def circle_area(r):\n ca = 3.14 * r * r\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":40101,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:56:52","func_code":"def rectangle_perimeter(n, a):\n rp = n + n + a + a\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":4728,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:56:52","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":386,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:56:52","func_code":"def square_perimeter(n):\n sp = n + n + n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":25704,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-19 22:56:52","func_code":"def circle_area(r):\n ca = 3.14 * r * r\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":7348,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-20 11:07:21","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":13847,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2017-10-20 11:07:21","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":631,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 17:51:48","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31616,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 17:51:48","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27864,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 20:32:58","func_code":"def square_perimeter(side):\n square_perimeter = side * 4\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":14387,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 20:32:58","func_code":"def circle_circumference(side):\n circle_circumference = side * 2 * 3.14\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":2597,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 20:32:58","func_code":"def circle_area(side):\n circle_area = 3.14 * side * side\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":26248,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 20:32:58","func_code":"def circle_circumference(side):\n circle_circumference = side * 2 * 3.14\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":9320,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 20:32:58","func_code":"def rectangle_perimeter(length, width):\n rectangle_perimeter = length + length + width + width\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":31134,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 20:32:58","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":31013,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 20:32:58","func_code":"def circle_area(side):\n circle_area = 3.14 * side * side\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":3469,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 20:32:58","func_code":"def rectangle_perimeter(length, width):\n rectangle_perimeter = length + length + width + width\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":32534,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 20:32:58","func_code":"def square_perimeter(side):\n square_perimeter = side * 4\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":6930,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-20 20:32:58","func_code":"def square_area(side):\n square_area = side * side\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":24924,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-21 15:50:55","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n s = i\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(s):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":40048,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-21 15:51:07","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n s = i\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":27240,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-21 15:52:11","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n s = i\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":1041,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-21 16:11:34","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n i = s\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":32433,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-21 16:12:31","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n i = s\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":24932,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-21 16:13:28","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n s = i\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":30553,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-21 16:14:05","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n s = i\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":34439,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-21 16:14:05","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n s = i\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":5747,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-21 16:14:05","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n s = i\n while i < len(a):\n if a[i] < a[s]:\n s = i\n i = i + 1\n return s\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n x = find_position_of_smallest(a, i)\n swap(a, i, x)\n i = i + 1\n return x","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":3386,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-21 19:19:31","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while i < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":39236,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-21 19:20:42","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while i < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":29208,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-21 19:21:35","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while i < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":10723,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-21 19:23:04","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":11228,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2017-10-21 19:23:04","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":10037,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:29:41","func_code":"def square_area(x):\n sq = x * x\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":28858,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:29:41","func_code":"def square_area(x):\n sq = x * x\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":37319,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:36:49","func_code":"def rectangle_perimeter(x, y):\n rper = x + x + y + y\n return rper","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":18628,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:36:49","func_code":"def square_area(x):\n sq = x * x\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":30140,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:36:49","func_code":"def circle_circumference(x):\n crcc = 2 * 3.14 * x\n return crcc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":27107,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:36:49","func_code":"def circle_area(x):\n crca = 3.14 * (x * x)\n return crca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":3525,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:36:49","func_code":"def circle_area(x):\n crca = 3.14 * (x * x)\n return crca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":23349,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:36:49","func_code":"def circle_circumference(x):\n crcc = 2 * 3.14 * x\n return crcc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":6527,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:36:49","func_code":"def square_area(x):\n sq = x * x\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8261,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:36:49","func_code":"def square_perimeter(x):\n sqper = x * 4\n return sqper","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":12857,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:36:49","func_code":"def rectangle_perimeter(x, y):\n rper = x + x + y + y\n return rper","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":36843,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-10-22 13:36:49","func_code":"def square_perimeter(x):\n sqper = x * 4\n return sqper","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":699,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:28:32","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":421,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:39:58","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27990,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:39:58","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":21684,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 11:39:59","func_code":"def square_area(x):\n return x * x","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33583,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:42:26","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":38796,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:42:26","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":18996,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:42:26","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":10491,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:42:26","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":4525,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:42:26","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":12056,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:42:26","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":9468,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:42:26","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5866,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:42:26","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":9674,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:42:26","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":16020,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-10-23 11:42:26","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7674,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-10-23 11:47:57","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":2723,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 11:48:12","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":28004,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 11:48:12","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":10260,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 11:53:30","func_code":"def circle_area(n):\n return n * n * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":7546,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 11:53:30","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20853,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 11:55:05","func_code":"def circle_area(n):\n return n * n * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":23247,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 11:55:05","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33611,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 11:56:27","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":5483,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 11:56:27","func_code":"def circle_area(y):\n return n * n * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":162,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-10-23 11:58:12","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":40935,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-10-23 11:58:12","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":26547,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:03:35","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39551,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:03:35","func_code":"def circle_area(n):\n return n * n * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":41159,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:04:15","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":28372,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:04:15","func_code":"def rectangle_perimeter(x1, y1):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":17637,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:04:15","func_code":"def circle_area(n):\n return n * n * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":13618,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:05:20","func_code":"def rectangle_perimeter(x1, y1):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":33557,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:05:20","func_code":"def square_perimeter(n):\n return x * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":23190,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:05:20","func_code":"def circle_area(n):\n return n * n * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":36612,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:05:20","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":15700,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:05:49","func_code":"def circle_area(n):\n return n * n * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":27220,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:05:49","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":23250,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:05:49","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25656,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:05:49","func_code":"def rectangle_perimeter(x1, y1):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":42240,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:06:16","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":16192,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:06:16","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":35023,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:06:16","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":23868,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:06:16","func_code":"def rectangle_perimeter(x1, y1):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":6006,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:07:04","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10495,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:07:04","func_code":"def rectangle_perimeter(x1, y1):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":40827,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:07:04","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":40887,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:07:04","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":19394,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:07:04","func_code":"def square_area(n):\n return n * n","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":2823,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:07:04","func_code":"def circle_circumference(n):\n return n * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":36754,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:07:04","func_code":"def circle_area(n):\n return n * n * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":28419,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:07:04","func_code":"def square_perimeter(n):\n return n * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":13811,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:07:04","func_code":"def rectangle_perimeter(x1, y1):\n return (x1 + y1) * 2","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":33077,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-10-23 12:07:04","func_code":"def circle_circumference(n):\n return n * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":40859,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-10-23 12:46:44","func_code":"def square_area(n):\n bob = n ** 2\n return bob","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16768,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-10-23 12:46:44","func_code":"def square_area(n):\n bob = n ** 2\n return bob","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":17411,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-10-23 12:47:29","func_code":"def swap(a, i, j):\n temp = a[i]\n a[i] = a[j]\n a[j] = temp\n\n\ndef find_position_of_smallest(a, i):\n tempnum = i\n while i != len(a):\n if a[i] < a[tempnum]:\n tempnum = i\n i = i + 1\n return tempnum\n\n\ndef sort(a):\n i = 0\n j = 0\n while i != len(a):\n j = find_position_of_smallest(a, i)\n swap(a, i, j)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":5387,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-10-23 12:47:29","func_code":"def swap(a, i, j):\n temp = a[i]\n a[i] = a[j]\n a[j] = temp\n\n\ndef find_position_of_smallest(a, i):\n tempnum = i\n while i != len(a):\n if a[i] < a[tempnum]:\n tempnum = i\n i = i + 1\n return tempnum\n\n\ndef sort(a):\n i = 0\n j = 0\n while i != len(a):\n j = find_position_of_smallest(a, i)\n swap(a, i, j)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":6787,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:02:58","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4405,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:02:58","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20599,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:04:41","func_code":"def square_perimeter(n):\n sq = n + n + n + n\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":28082,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:05:07","func_code":"def square_area(n):\n sq = n + n + n + n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":35420,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:07:37","func_code":"def square_perimeter(n):\n sq = n + n + n + n\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":33303,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:25:29","func_code":"def circle_circumference(n):\n cr = 2 * 3.14 * n\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":29025,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:25:29","func_code":"def circle_area(n):\n cr = (3.14 * n) ** 2\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":21290,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:25:29","func_code":"def rectangle_perimeter(y):\n rc = n + n + y + y","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":24177,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:25:29","func_code":"def square_area(n):\n sq = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":28536,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:25:29","func_code":"def square_perimeter(n):\n sq = n + n + n + n\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":27067,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:28:30","func_code":"def square_perimeter(n):\n sq = n + n + n + n\n return square_perimeter","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":19843,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:28:30","func_code":"def circle_circumference(n):\n cr = 2 * 3.14 * n\n return circle_circumference","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":39127,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:28:30","func_code":"def circle_area(n):\n cr = (3.14 * n) ** 2\n return circle_area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":25327,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:28:30","func_code":"def square_area(n):\n sq = n * n\n return square_area","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":1827,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:28:30","func_code":"def rectangle_perimeter(y):\n rc = n + n + y + y\n return rectangle_perimeter","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":28134,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:33:56","func_code":"def circle_circumference(n):\n cr = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":7412,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:33:56","func_code":"def rectangle_perimeter(n, m):\n rc = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":20666,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:33:56","func_code":"def square_perimeter(n):\n sq = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":1177,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:33:56","func_code":"def square_area(n):\n sq = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":33080,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:33:56","func_code":"def circle_area(n):\n cr = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":3032,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:34:46","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":29566,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:34:46","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":4387,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:34:46","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26596,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:34:46","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":15665,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:34:46","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":8259,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:34:46","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29072,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:34:46","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":25480,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:34:46","func_code":"def rectangle_perimeter(n, m):\n result = n + n + m + m\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":4770,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:34:46","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":13667,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2017-10-23 13:34:46","func_code":"def square_perimeter(n):\n result = n + n + n + n\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":3105,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:50:04","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":38823,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:50:04","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8996,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:52:46","func_code":"def rectangle_perimeter(n, x):\n rec = n * 2 + x * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":26575,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:52:46","func_code":"def circle_circumference(n):\n c = n * 2 * 3.14\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":24126,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:52:46","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":1607,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:52:46","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":8740,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:52:46","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":15643,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:52:46","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":5928,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:52:46","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":14957,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:52:46","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":25253,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:52:46","func_code":"def rectangle_perimeter(n, x):\n rec = n * 2 + x * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":33124,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:52:46","func_code":"def circle_circumference(n):\n c = n * 2 * 3.14\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":149,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:56:17","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, p, i)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":227,"user":"68924c1a-b73a-453a-8e6e-c74969576746","date":"2017-10-23 18:56:17","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, p, i)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":6814,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-10-23 20:12:06","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":2912,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-10-23 20:15:02","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":20045,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-10-23 20:15:37","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":37602,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-10-23 20:16:05","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":21046,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-10-23 20:16:28","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":18625,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-10-23 20:18:10","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":3279,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-10-23 20:18:10","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":11426,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 00:15:49","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":5585,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 00:16:49","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":37131,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 00:17:34","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, p)\n i += 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":7488,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 00:18:25","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, p)\n i += 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":38268,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 00:19:43","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, i, p)\n i += 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":41426,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:48:11","func_code":"def circle_circumference(n):\n c = n * 2 * 3.14\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":15892,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:48:11","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":14367,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:48:11","func_code":"def rectangle_perimeter(n, x):\n rec = n * 2 + x * 2\n return c","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":16453,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:48:11","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":15728,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:48:11","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":37369,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:49:45","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25783,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:49:45","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":25319,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:49:45","func_code":"def circle_circumference(n):\n c = n * 2 * 3.14\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":18568,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:49:45","func_code":"def rectangle_perimeter(n, x):\n rec = n * 2 + x * 2\n return c","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":37116,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:49:45","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":33529,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:50:05","func_code":"def rectangle_perimeter(n, x):\n rec = n * 2 + x * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":18805,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:50:05","func_code":"def circle_circumference(n):\n c = n * 2 * 3.14\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":4496,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:50:05","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":11126,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:50:05","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":25295,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:50:05","func_code":"def square_perimeter(n):\n perm = n + n + n + n\n return perm","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":35612,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:50:05","func_code":"def circle_area(n):\n area = 3.14 * n * n\n return area","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":14401,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:50:05","func_code":"def circle_circumference(n):\n c = n * 2 * 3.14\n return c","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":30955,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:50:05","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9395,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:50:05","func_code":"def rectangle_perimeter(n, x):\n rec = n * 2 + x * 2\n return rec","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":19447,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:50:05","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":282,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:51:23","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":18372,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2017-10-24 00:51:23","func_code":"def square_area(n):\n side = n * n\n return side","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39223,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 11:51:12","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, j)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":5425,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 11:52:01","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, j)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":18034,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 11:53:12","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, j)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":36251,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 11:55:21","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, j)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":27851,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 11:56:11","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, j)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":12041,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 12:00:02","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, j)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":25473,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 12:03:14","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, j)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":30465,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 12:04:37","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n while i < len(a):\n p = find_position_of_smallest\n swap(a, i, j)\n i += 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":37955,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 12:05:55","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, i, j)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":14205,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 12:06:21","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":16564,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-10-24 12:06:21","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":27687,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-10-24 12:34:53","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41310,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2017-10-24 12:34:53","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":9099,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-10-24 17:33:07","func_code":"def circle_circumference(n):\n cir = 2 * 3.14 * n\n return cir","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":4221,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-10-24 17:33:07","func_code":"def rectangle_perimeter(n, m):\n recper = n * 2 + m * 2\n return recper","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":32321,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-10-24 17:33:07","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33692,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-10-24 17:33:07","func_code":"def square_perimeter(n):\n per = n * 4\n return per","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":37855,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-10-24 17:33:07","func_code":"def square_perimeter(n):\n per = n * 4\n return per","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":7740,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-10-24 17:33:07","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29006,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-10-24 17:33:07","func_code":"def circle_circumference(n):\n cir = 2 * 3.14 * n\n return cir","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":16783,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-10-24 17:33:07","func_code":"def circle_area(n):\n ar = 3.14 * n ** 2\n return ar","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":28009,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-10-24 17:33:07","func_code":"def circle_area(n):\n ar = 3.14 * n ** 2\n return ar","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":16110,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-10-24 17:33:07","func_code":"def rectangle_perimeter(n, m):\n recper = n * 2 + m * 2\n return recper","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":31902,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-10-24 18:03:58","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, p, i)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":5115,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-10-24 18:03:58","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, p, i)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":41926,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 19:20:57","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n smallest = find_position_of_smallest(a, i)\n swap(a, i, smallest)\n i += 1\n return a","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":21476,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 19:20:57","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n smallest = find_position_of_smallest(a, i)\n swap(a, i, smallest)\n i += 1\n return a","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":5105,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 19:55:12","func_code":"def square_area(x):\n return x ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":22630,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 19:55:34","func_code":"def square_area(x):\n return x ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29144,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:18:56","func_code":"def square_area(x):\n return x ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16965,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:18:56","func_code":"def circle_area(r):\n return r * r * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":22761,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:18:56","func_code":"def square_perimeter(x):\n return x ** 2","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":28852,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:18:56","func_code":"def rectangle_perimeter(x, y):\n return (2)(x + y)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":30654,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:18:56","func_code":"def circle_circumference(r):\n return r * 2 * 3.141","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":19314,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:19:52","func_code":"def square_perimeter(x):\n return x * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":28432,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:19:52","func_code":"def circle_area(r):\n return r * r * 3.141","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":31297,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:19:52","func_code":"def rectangle_perimeter(x, y):\n return (2)(x + y)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":14746,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:19:52","func_code":"def circle_circumference(r):\n return r * 2 * 3.141","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":11386,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:19:52","func_code":"def square_area(x):\n return x ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29878,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:20:30","func_code":"def square_perimeter(x):\n return x * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":9133,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:20:30","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":23298,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:20:30","func_code":"def square_area(x):\n return x ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7631,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:20:30","func_code":"def circle_circumference(r):\n return r * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":12640,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:20:30","func_code":"def rectangle_perimeter(x, y):\n return (2)(x + y)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":false} {"submission_id":41053,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:20:54","func_code":"def square_perimeter(x):\n return x * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":28459,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:20:54","func_code":"def circle_circumference(r):\n return r * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":23253,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:20:54","func_code":"def rectangle_perimeter(x, y):\n return 2 * (x + y)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":24449,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:20:54","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":23187,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 20:20:54","func_code":"def square_area(x):\n return x ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39577,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def circle_circumference(r):\n return r * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":37873,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def rectangle_perimeter(x, y):\n return 2 * (x + y)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":24867,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def square_area(x):\n return x ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":4868,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def square_area(x):\n return x ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":10689,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def square_perimeter(x):\n return x * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":25647,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def square_area(x):\n return x ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":36565,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def square_area(x):\n return x ** 2","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":40942,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def square_perimeter(x):\n return x * 4","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":42308,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":37927,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def circle_circumference(r):\n return r * 2 * 3.14","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":23482,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def circle_area(r):\n return r * r * 3.14","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":10205,"user":"eaa6d595-9cde-4610-b2ba-a1bb3e0f1c67","date":"2017-10-24 21:08:04","func_code":"def rectangle_perimeter(x, y):\n return 2 * (x + y)","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":9619,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-15 17:26:25","func_code":"def reverse(a):\n rev = []\n i = 0\n while i < len(a):\n rev.append(a[len(a) - i])\n i = i + 1\n print(rev)","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":false} {"submission_id":41825,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-15 17:26:58","func_code":"def reverse(a):\n rev = []\n i = 0\n while i < len(a):\n rev.append(a[len(a) - i])\n i = i + 1\n print(rev.rstrip())","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":false} {"submission_id":39634,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-15 17:27:10","func_code":"def reverse(a):\n rev = []\n i = 0\n while i < len(a):\n rev.append(a[len(a) - i])\n i = i + 1\n print(rev.strip())","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":false} {"submission_id":25576,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-15 17:27:26","func_code":"def reverse(a):\n rev = []\n i = 0\n while i < len(a):\n rev.append(a[len(a) - i])\n i = i + 1\n print(rev)","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":false} {"submission_id":22381,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-15 17:27:26","func_code":"def reverse(a):\n rev = []\n i = 0\n while i < len(a):\n rev.append(a[len(a) - i])\n i = i + 1\n print(rev)","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":false} {"submission_id":30666,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-16 12:45:50","func_code":"def reverse(a):\n rev = []\n i = 0\n while i < len(a):\n rev.append(a[len(a) - i])\n i = i + 1\n return rev","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":false} {"submission_id":11676,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-16 12:47:30","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n print(a[len(a) - i - 1])\n i = i + 1","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":false} {"submission_id":24951,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-16 12:48:56","func_code":"def reverse(a):\n i = 0\n rev = []\n while i < len(a):\n rev.append(a[len(a) - i - 1])\n i = i + 1\n return rev","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":true} {"submission_id":3763,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-16 12:48:56","func_code":"def reverse(a):\n i = 0\n rev = []\n while i < len(a):\n rev.append(a[len(a) - i - 1])\n i = i + 1\n return rev","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":true} {"submission_id":21734,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-11-16 13:32:03","func_code":"def reverse(a):\n rev = []\n for i in len(a):\n rev.append(a[len(a) - i - 1])\n return rev","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":false} {"submission_id":947,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-11-16 13:32:28","func_code":"def reverse(a):\n rev = []\n i = 0\n for i in len(a):\n rev.append(a[len(a) - i - 1])\n return rev","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":false} {"submission_id":27641,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-11-16 13:33:01","func_code":"def reverse(a):\n rev = []\n i = 0\n while i < len(a):\n rev.append(a[len(a) - i - 1])\n i = i + 1\n return rev","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":true} {"submission_id":2182,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2017-11-16 13:33:01","func_code":"def reverse(a):\n rev = []\n i = 0\n while i < len(a):\n rev.append(a[len(a) - i - 1])\n i = i + 1\n return rev","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":true} {"submission_id":3090,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-16 19:24:48","func_code":"def reverse(string):\n results = string[::-1]\n return string[::-1]","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":true} {"submission_id":35496,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-16 19:24:48","func_code":"def reverse(string):\n results = string[::-1]\n return string[::-1]","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":true} {"submission_id":40729,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-16 19:24:48","func_code":"def reverse(string):\n results = string[::-1]\n return string[::-1]","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":true} {"submission_id":34101,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-20 07:03:30","func_code":"def union(a, b):\n da = {}\n db = {}\n i = 0\n while i < len(a):\n da[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n db[b[i]] = True\n i = i + 1\n c = []\n for key in da:\n c.append(key)\n for key in db:\n if key not in da:\n c.append(key)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":40896,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-20 07:03:30","func_code":"def intersection(a, b):\n da = {}\n db = {}\n i = 0\n while i < len(a):\n da[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n db[b[i]] = True\n i = i + 1\n c = []\n for key in da:\n if key in db:\n c.append(key)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":29259,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-20 07:08:34","func_code":"def intersection(a, b):\n da = {}\n db = {}\n i = 0\n while i < len(a):\n da[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n db[b[i]] = True\n i = i + 1\n c = []\n for key in da:\n if key in db:\n c.append(key)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":22089,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-20 07:08:34","func_code":"def union(a, b):\n da = {}\n db = {}\n i = 0\n while i < len(a):\n da[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n db[b[i]] = True\n i = i + 1\n c = []\n for key in da:\n c.append(key)\n for key in db:\n if key not in da:\n c.append(key)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":42014,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 13:58:57","func_code":"def union(a, b):\n un = a + b\n return un","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":9458,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:01:38","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n j = 0\n while j < len(b):\n if b[i] not in a:\n c.append(b[i])\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":34515,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:01:38","func_code":"def intersection():\n c = []\n while i < len(a):\n if a[i] in b:\n c.append(a[i])\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":8586,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-20 14:01:49","func_code":"def union(a, b):\n union = a + b\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":23985,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:06:45","func_code":"def intersection():\n c = []\n while i < len(a):\n if a[i] in b:\n c.append(a[i])\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":38579,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:06:45","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in a:\n c.append(b[k])\n k = k + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":41251,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:07:03","func_code":"def intersection(a, b):\n c = []\n while i < len(a):\n if a[i] in b:\n c.append(a[i])\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":26397,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:07:03","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in a:\n c.append(b[k])\n k = k + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":19600,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:07:20","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in a:\n c.append(b[k])\n k = k + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":39245,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:07:20","func_code":"def intersection(a, b):\n c = []\n i = 0\n while i < len(a):\n if a[i] in b:\n c.append(a[i])\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":4849,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-20 14:09:49","func_code":"def union(a, b):\n i = 0\n while i < len(a) and a[i] != v:\n i = i + 1\n return i < len(a)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":24429,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-20 14:10:05","func_code":"def union(a, b):\n i = 0\n while i < len(a) and a[i] != b:\n i = i + 1\n return i < len(a)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":3974,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:10:38","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":21622,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:10:38","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":24028,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:10:56","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":8434,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:10:56","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":41377,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:10:56","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":6396,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2017-11-20 14:10:56","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":6738,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-20 14:11:13","func_code":"def union(a, b):\n i = 0\n while i < len(a) and a[i] != b:\n i = i + 1\n return i < len(a)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":41863,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-20 14:13:57","func_code":"def union(a, b):\n union = a + b\n return sorted(sets.union(a, b))","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":22515,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 14:14:28","func_code":"def intersection(a, b):\n un = a + b\n return un","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":28369,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:15:02","func_code":"def union(a, b):\n return a + b","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":8086,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:16:49","func_code":"def union(a, b):\n i = 0\n while i < len(a):\n c = a.append(b[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":4862,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 14:18:12","func_code":"def intersection(a, b):\n un = a + b\n return un","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":1933,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 14:18:12","func_code":"def union(a, b):\n i = 0\n while i < len(lines):\n if lines[i] not in seen:\n sys.stdout.write(lines[i])\n seen[lines[i]] = True\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":3836,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 14:18:39","func_code":"def union(a, b):\n i = 0\n while i < len(a):\n if a[i] not in seen:\n sys.stdout.write(a[i])\n seen[a[i]] = True\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":4978,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 14:18:39","func_code":"def intersection(a, b):\n un = a + b\n return un","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":15381,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:18:57","func_code":"def union(a, b):\n a = []\n b = []\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":14399,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:19:44","func_code":"def union(a, b):\n a = []\n b = []\n return result","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":33628,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:20:13","func_code":"def union(a, b):\n a = []\n b = []\n return a, b","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":18930,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:20:40","func_code":"def union(a, b):\n a = [1, 2, 3, 4]\n b = [3, 4, 5, 6]\n return a, b","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":37735,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:21:43","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while i < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":39775,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:21:51","func_code":"def union(a, b):\n i = 0\n c = {}\n while i < len(a):\n c.append(a[i])\n if b[i] not in c:\n c.append(b[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":12186,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 14:21:56","func_code":"def intersection(a, b):\n un = a + b\n return un","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":31,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 14:21:56","func_code":"def union(a, b):\n i = 0\n while i < len(a + b):\n if a[i] not in seena:\n sys.stdout.write(a[i])\n seen[a[i]] = True\n elif b[i] not in seenb:\n sys.stdout.wrtie(b[i])\n seen[b[i]] = True\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":2893,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:22:44","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while i < len(j):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":11820,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:23:08","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n c.append(a[i])\n if b[i] not in c:\n c.append(b[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":5475,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:23:09","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(j):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":33644,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-11-20 14:23:38","func_code":"def union(a, b):\n d = {}\n i = 0\n while i < len(lines):\n d = {a, b}\n return d","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":7593,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2017-11-20 14:23:38","func_code":"def union(a, b):\n d = {}\n i = 0\n while i < len(lines):\n d = {a, b}\n return d","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":36809,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 14:23:46","func_code":"def intersection(a, b):\n un = a + b\n return un","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":35085,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 14:23:46","func_code":"def intersection(a, b):\n un = a + b\n return un","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":13526,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 14:23:46","func_code":"def union(a, b):\n i = 0\n while i < len(a + b):\n if a[i] not in seena:\n c.append(a[i])\n elif b[i] not in seenb:\n c.append(a[i])\n i = i + 1\n print(c)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":24854,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:23:46","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":18069,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:23:46","func_code":"def sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":4213,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2017-11-20 14:23:46","func_code":"def union(a, b):\n i = 0\n while i < len(a + b):\n if a[i] not in seena:\n c.append(a[i])\n elif b[i] not in seenb:\n c.append(a[i])\n i = i + 1\n print(c)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":33475,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:24:06","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if b[i] not in c:\n c.append(b[i])\n elif a[i] not in c:\n c.append(a[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":27830,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-11-20 14:24:34","func_code":"def union(a, b):\n c = a + b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":42485,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:25:05","func_code":"def union(a, b):\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in c:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":40568,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:25:05","func_code":"def intersection(a, b):\n i = 0\n while i < len(a):\n if a[i] in b:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":3811,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:25:38","func_code":"def union(a, b, c):\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in c:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":17947,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:25:38","func_code":"def intersection(a, b, d):\n i = 0\n while i < len(a):\n if a[i] in b:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":23888,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:26:05","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in c:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":32838,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:26:05","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":2091,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:26:21","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":10847,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:26:43","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(c):\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":26395,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-11-20 14:26:47","func_code":"def intersection(a, b):\n d = a + b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":21450,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-11-20 14:26:47","func_code":"def union(a, b):\n c = a, b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":19837,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:27:09","func_code":"def union(a, b):\n result = a + b\n return result","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":18265,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:27:15","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a) and i < len(c):\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":19456,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:27:32","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in a:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":16949,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:27:32","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":39658,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:27:33","func_code":"def union(a, b):\n i = 0\n c = []\n while i < 6:\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":21604,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:27:51","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":13636,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:28:04","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a) + len(b):\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":28921,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2017-11-20 14:28:10","func_code":"def intersection(a, b):\n d = a + b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":20044,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2017-11-20 14:28:10","func_code":"def union(a, b):\n c = a or b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":35975,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:28:19","func_code":"def union(a, b):\n result = a + b\n i = 0\n while i < len(a) and a[i] == s:\n i = i + 1\n return result","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":31729,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:28:31","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":20682,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:28:44","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n while i < len(a) and a[i] == s:\n i = i + 1\n return result","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":32012,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:28:46","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":16793,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:28:46","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in c:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":38074,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2017-11-20 14:29:45","func_code":"def intersection(a, b):\n d = a and b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":36305,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2017-11-20 14:29:45","func_code":"def union(a, b):\n c = a or b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":1375,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-11-20 14:30:02","func_code":"def union(a, b):\n c = a or b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":8598,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-11-20 14:30:02","func_code":"def intersection(a, b):\n d = a and b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":16154,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:30:23","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n while i < len(a) and a[i] == s:\n i = i + 1\n if i == len(s):\n s.append(line)\n return result","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":2584,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:31:10","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n while i < len(a) and a[i] == s:\n i = i + 1\n if i == len(s):\n s.append(result[i])\n return result","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":12372,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:31:55","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(6):\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":20030,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:32:06","func_code":"def union(a, b):\n i = 0\n c = []\n while i < 6:\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":23303,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:32:08","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b and a[i] not in d:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":27184,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:32:08","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in c:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":41158,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:32:08","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in c:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":36470,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2017-11-20 14:32:08","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b and a[i] not in d:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":13706,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 14:32:35","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n sys.stdout.write(a[i])\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(seen):\n if b[i] not in seen:\n sys.stdout.write(b[i])\n seen[b[i]] = True\n i = i + 1\n for list in seen:\n print(list)\n if __name__ == '__main__':\n print(union([1, 2, 3], [3, 4, 5]))","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":10940,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-11-20 14:32:58","func_code":"def intersection(a, b):\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] in c:\n d.append(b[p])\n p = p + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":30713,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:33:27","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":38993,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:33:45","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n line = sys.stdin.readline()\n while 0 < len(line):\n while i < len(a) and s[i] != line:\n i = i + 1\n if i == len(s):\n s.append(line)\n return result","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":22097,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-11-20 14:33:47","func_code":"def intersection(a, b):\n return a or b","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":7162,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-11-20 14:33:47","func_code":"def union(a, b):\n return a and b","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":21294,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:33:57","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n line = sys.stdin.readline()\n while 0 < len(line):\n while i < len(a) and s[i] != line:\n i = i + 1\n if i == len(s):\n s.append(line)\n return result","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":11212,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2017-11-20 14:34:06","func_code":"def intersection(a, b):\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] in c:\n d.append(b[p])\n p = p + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":2010,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:34:25","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n line = results[i]\n while 0 < len(line):\n while i < len(a) and s[i] != line:\n i = i + 1\n if i == len(s):\n s.append(line)\n return result","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":30679,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-11-20 14:34:34","func_code":"def intersection(a, b):\n return a or b","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":40234,"user":"99d129a4-97af-42ac-a543-23b9157331f8","date":"2017-11-20 14:34:34","func_code":"def union(a, b):\n return a and b","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":31472,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:34:35","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n line = result[i]\n while 0 < len(line):\n while i < len(a) and s[i] != line:\n i = i + 1\n if i == len(s):\n s.append(line)\n return result","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":7030,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:34:45","func_code":"def union(a, b):\n i = 0\n while i < len(a):\n c.appened(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in a:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":31213,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:34:45","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b and a[i] not in d:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":23132,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:34:51","func_code":"def union(a, b):\n i = 0\n d = {}\n while i < len(a):\n d[a[i]] = True\n i = i + 1\n print(d)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":26545,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:35:34","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n line = result[i]\n while 0 < len(line):\n while i < len(a) and s[i] != line:\n i = i + 1\n if i == len(s):\n s.append(line)\n return line.rstrip()","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":41074,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:35:36","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b and a[i] not in d:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":6276,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:35:36","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n c.appened(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in a:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":16877,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:36:00","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b and a[i] not in d:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":32024,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:36:00","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in a:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":16165,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:36:07","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n line = result[i]\n while 0 < line:\n while i < len(a) and s[i] != line:\n i = i + 1\n if i == len(s):\n s.append(line)\n return line.rstrip()","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":24098,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:36:25","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n line = result[i]\n while 0 < line:\n while i < a and s[i] != line:\n i = i + 1\n if i == len(s):\n s.append(line)\n return line.rstrip()","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":17573,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-11-20 14:36:30","func_code":"def intersection(a, b):\n c = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in c:\n c[a[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":25461,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-11-20 14:36:30","func_code":"def union(a, b):\n c = {}\n i = 0\n while i < len(a):\n c[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in c:\n c[b[k]] = True\n k = k + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":7277,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:36:35","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in a:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":40856,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:36:35","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b and a[i] not in d:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":24281,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-11-20 14:37:19","func_code":"def union(a, b):\n x = a + b\n while 0 < len(x):\n i = 0\n while i < len(x) and x[i] != x:\n i = i + 1\n if i == len(x):\n d[x[i]] = True\n print(union([1, 2, 3], [3, 4, 5]))","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":14597,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:38:18","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n line = result[i]\n while i < len(a):\n seen[a[i]] = True\n while i < a and s[i] != line:\n i = i + 1\n if i == len(s):\n s.append(line)\n return","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":10977,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:38:33","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n line = result[i]\n while i < len(a):\n s[a[i]] = True\n while i < a and s[i] != line:\n i = i + 1\n if i == len(s):\n s.append(line)\n return","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":38101,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 14:38:46","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n sys.stdout.write(a[i])\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(seen):\n if b[i] not in seen:\n sys.stdout.write(b[i])\n seen[b[i]] = True\n i = i + 1\n print(seen)\n if __name__ == '__main__':\n print(union([1, 2, 3], [3, 4, 5]))","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":607,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-11-20 14:39:13","func_code":"def union(a, b):\n x = a + b\n while 0 < len(x):\n i = 0\n while i < len(x) and x[i] != x:\n i = i + 1\n if i == len(x):\n d[x[i]] = True\n print(union([1, 2, 3], [3, 4, 5]))","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":21377,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2017-11-20 14:39:13","func_code":"def union(a, b):\n x = a + b\n while 0 < len(x):\n i = 0\n while i < len(x) and x[i] != x:\n i = i + 1\n if i == len(x):\n d[x[i]] = True\n print(union([1, 2, 3], [3, 4, 5]))","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":14111,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:39:17","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in c:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":7746,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:39:17","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b and a[i] not in d:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":9086,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-11-20 14:39:47","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":17654,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-11-20 14:39:47","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":13566,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:40:30","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in c:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":373,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:40:30","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b and a[i] not in d:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":23941,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-11-20 14:40:31","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":15963,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-11-20 14:40:31","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":31872,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-11-20 14:40:31","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":37362,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2017-11-20 14:40:31","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":41421,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:40:45","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n while i < len(a):\n s[a[i]] = True\n i = i + 1\n return","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":22595,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:40:59","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":22553,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:40:59","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":40612,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:41:41","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":15746,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:41:41","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":3515,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:42:00","func_code":"def union(a, b):\n i = 0\n d = {}\n while i < len(a):\n d[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if b[k] not in d:\n d[b[k]] = True\n k = k + 1\n return d","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":40175,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:42:18","func_code":"def union(a, b):\n result = a + b\n s = []\n i = 0\n while i < len(a):\n s[a[i]] = True\n i = i + 1\n if a[i] in s:\n s.append()\n return","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":15140,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 14:42:25","func_code":"def union(a, b):\n c = {}\n i = 0\n while i < len(a):\n sys.stdout.write(a[i])\n c[a[i]] = True\n i = i + 1\n i = 0\n while i < len(seen):\n if b[i] not in seen:\n sys.stdout.write(b[i])\n c[b[i]] = True\n i = i + 1\n print(c)\n if __name__ == '__main__':\n print(union([1, 2, 3], [3, 4, 5]))","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":7037,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:43:03","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":10083,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:43:03","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":37380,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-11-20 14:43:26","func_code":"def union(a, b):\n ab = a + b\n c = []\n for i in ab:\n if i not in c:\n c.append(i)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":23269,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-11-20 14:43:26","func_code":"def union(a, b):\n ab = a + b\n c = []\n for i in ab:\n if i not in c:\n c.append(i)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":28258,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2017-11-20 14:43:26","func_code":"def union(a, b):\n ab = a + b\n c = []\n for i in ab:\n if i not in c:\n c.append(i)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":3204,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:43:28","func_code":"def union(a, b):\n i = 0\n d = {}\n while i < len(a):\n d[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in d:\n d[b[k]] = True\n k = k + 1\n return d","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":3095,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2017-11-20 14:43:32","func_code":"def union(a, b):\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":37806,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2017-11-20 14:43:32","func_code":"def union(a, b):\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":17992,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-20 14:43:39","func_code":"def intersection(a, b):\n da = {}\n db = {}\n i = 0\n while i < len(a):\n da[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n db[b[i]] = True\n i = i + 1\n c = []\n for key in da:\n if key in db:\n c.append(key)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":39690,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-20 14:43:39","func_code":"def union(a, b):\n da = {}\n db = {}\n i = 0\n while i < len(a):\n da[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n db[b[i]] = True\n i = i + 1\n c = []\n for key in da:\n c.append(key)\n for key in db:\n if key not in da:\n c.append(key)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":28007,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-20 14:43:39","func_code":"def union(a, b):\n da = {}\n db = {}\n i = 0\n while i < len(a):\n da[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n db[b[i]] = True\n i = i + 1\n c = []\n for key in da:\n c.append(key)\n for key in db:\n if key not in da:\n c.append(key)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":40,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-20 14:43:39","func_code":"def intersection(a, b):\n da = {}\n db = {}\n i = 0\n while i < len(a):\n da[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n db[b[i]] = True\n i = i + 1\n c = []\n for key in da:\n if key in db:\n c.append(key)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":23813,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-20 14:43:39","func_code":"def intersection(a, b):\n da = {}\n db = {}\n i = 0\n while i < len(a):\n da[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n db[b[i]] = True\n i = i + 1\n c = []\n for key in da:\n if key in db:\n c.append(key)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":20921,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-20 14:43:39","func_code":"def union(a, b):\n da = {}\n db = {}\n i = 0\n while i < len(a):\n da[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n db[b[i]] = True\n i = i + 1\n c = []\n for key in da:\n c.append(key)\n for key in db:\n if key not in da:\n c.append(key)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":11251,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:44:05","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":8056,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:44:05","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(b):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":28968,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:44:13","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":41171,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:44:13","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":4781,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 14:44:25","func_code":"def union(x, y):\n answer = []\n check = {}\n i = 0\n while i < len(x):\n if not x[i] in check:\n answer.append(x[i])\n check.append(x[i])\n i = i + 1\n j = 0\n while i < len(y):\n if not y[j] in check:\n answer.append(y[j])\n check.append(y[j])\n j = j + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":16486,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:44:55","func_code":"def union(a, b):\n i = 0\n d = {}\n while i < len(a):\n d[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if b[k] not in d:\n d[b[k]] = True\n k = k + 1\n return d","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":21940,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 14:45:40","func_code":"def union(x, y):\n answer = []\n check = {}\n i = 0\n while i < len(x):\n if not x[i] in check:\n answer.append(x[i])\n check.append(x[i])\n i = i + 1\n j = 0\n while i < len(y):\n if not y[j] in check:\n answer.append(y[j])\n check.append(y[j])\n j = j + 1\n return answer","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":14454,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:45:42","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":28948,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:45:46","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":19619,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:45:46","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":34845,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:46:16","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":11493,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:46:16","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":9709,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:46:39","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":12636,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:46:39","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":17937,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-11-20 14:46:45","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if b[j] not in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":16555,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:47:03","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while k < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":28164,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:47:03","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":22637,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:47:04","func_code":"def union(a, b):\n a not in b\n c = a + b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":15176,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:47:11","func_code":"def union(a, b):\n i = 0\n dic = {}\n while i < len(a):\n dic[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in dic:\n dic[b[k]] = True\n k = k + 1\n return dic","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":26497,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:47:16","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":122,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 14:47:16","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":22365,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:47:30","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":17862,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:47:49","func_code":"def union(a, b):\n i = 0\n dic = {}\n while i < len(a):\n dic[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in dic:\n dic[b[j]] = True\n j = j + 1\n return dic","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":10544,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:48:05","func_code":"def union(a, b):\n c = a + b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":29214,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 14:48:49","func_code":"def union(x, y):\n answer = []\n check = {}\n i = 0\n while i < len(x):\n if not x[i] in check:\n answer.append(x[i])\n check[x[i]] = True\n i = i + 1\n j = 0\n while i < len(y):\n if not y[j] in check:\n answer.append(y[j])\n check[y[j]] = True\n j = j + 1\n return answer","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":39839,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:49:04","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b and a[i] not in d:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":4063,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:49:04","func_code":"def intersection(a, b):\n d = []\n i = 0\n while i < len(a):\n if a[i] in b and a[i] not in d:\n d.append(a[i])\n i = i + 1\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":34578,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:49:04","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in c:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":30843,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2017-11-20 14:49:04","func_code":"def union(a, b):\n c = []\n i = 0\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n i = i + 1\n p = 0\n while p < len(b):\n if b[p] not in c:\n c.append(b[p])\n p = p + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":18408,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:49:06","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":2412,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:49:06","func_code":"def intersection(a, b):\n i = 0\n s = []\n while i < len(a) and i < len(b):\n if a[i] in b:\n s.append(a[i])\n i = i + 1\n return s","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":11641,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:49:23","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":23302,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-20 14:50:08","func_code":"def intersection(a, b):\n return list(set(a) & set(b))","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":28207,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-20 14:50:08","func_code":"def union(a, b):\n return list(set(a) | set(b))","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":30296,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:50:40","func_code":"def intersection(a, b):\n i = 0\n s = []\n while i < len(a) and i < len(b):\n if int(a[i]) in b:\n s.append(a[i])\n i = i + 1\n return s","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":4561,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:50:40","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":16706,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 14:50:57","func_code":"def union(a, b):\n c = {}\n i = 0\n while i < len(a):\n c[a[i]] = True\n i = i + 1\n i = 0\n while i < len(seen):\n if b[i] not in seen:\n c[b[i]] = True\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":24293,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:50:57","func_code":"def union(a, b):\n i = 0\n dic = {}\n while i < len(a):\n dic[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in dic:\n dic[b[j]] = True\n j = j + 1\n return dic","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":35534,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:51:08","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":10010,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:51:08","func_code":"def intersection(a, b):\n i = 0\n s = []\n while i < len(a) and i < len(b):\n if a[i] in b:\n s.append(a[i])\n i = i + 1\n return set(s)","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":42128,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 14:51:38","func_code":"def union(a, b):\n A = 'end'\n i = ''\n c = []\n while i != A:\n if a[i] not in c:\n c.append(a[i])\n elif c[i] not in c:\n c.append(c[i])\n else:\n i = A\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":16667,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:52:20","func_code":"def intersection(a, b):\n d = a - b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":16874,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:52:20","func_code":"def union(a, b):\n c = a + b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":2293,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-11-20 14:52:40","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = TRue\n i = i + 1\n k = 0\n while i < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":33167,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-11-20 14:52:40","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":7973,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-11-20 14:53:00","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":13077,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-11-20 14:53:00","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while i < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":1213,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:53:03","func_code":"def intersection(a, b):\n d = a - b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":12040,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:53:03","func_code":"def union(a, b):\n c = a + b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":17505,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-11-20 14:53:27","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":23018,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-11-20 14:53:27","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":27371,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-11-20 14:53:27","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":5774,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2017-11-20 14:53:27","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":14285,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-11-20 14:53:56","func_code":"def intersection(a, b):\n int_seen = {}\n k = 0\n while k < len(a):\n if a[k] in b:\n int_seen[a[k]] = True\n k = k + 1\n return int_seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":40773,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-11-20 14:53:56","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if b[j] not in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":3906,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-11-20 14:54:25","func_code":"def union(a, b):\n i = 0\n seen = []\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in b:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":20273,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:54:29","func_code":"def union(a, b):\n seen = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[k] in b:\n seen[b[k]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":11034,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:54:35","func_code":"def union(a, b):\n c = a + b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":32207,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:54:35","func_code":"def intersection(a, b):\n d = a - b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":25658,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 14:55:13","func_code":"def union(a, b):\n seen = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(seen):\n if b[i] not in seen:\n seen[b[i]] = True\n i = i + 1\n for c in seen:\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":28271,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:55:14","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":20824,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:55:14","func_code":"def union(a, b):\n i = 0\n dic = {}\n while i < len(a):\n dic[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in dic:\n dic[b[j]] = True\n j = j + 1\n return dic","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":38001,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-11-20 14:55:34","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if b[j] not in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":20042,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-11-20 14:55:34","func_code":"def intersection(a, b):\n int_seen = {}\n leng = len(a)\n k = 0\n while k < leng:\n if a[k] in b:\n int_seen[a[k]] = True\n k = k + 1\n return int_seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":7555,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:55:34","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":41543,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:55:34","func_code":"def intersection(a, b):\n i = 0\n s = []\n while i < len(a) and i < len(b):\n if a[i] in b:\n s.append(a[i])\n i = i + 1\n n = 0","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":1484,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:55:45","func_code":"def union(a, b):\n c = a + b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":11150,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:55:45","func_code":"def intersection(a, b):\n d = a + b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":13397,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:55:56","func_code":"def intersection(a, b):\n i = 0\n s = []\n while i < len(a) and i < len(b):\n if a[i] in b:\n s.append(a[i])\n i = i + 1\n return s","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":9371,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:55:56","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":1573,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-11-20 14:56:29","func_code":"def union(a, b):\n i = 0\n seen = []\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in b:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":24952,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:57:06","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":13634,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:57:06","func_code":"def union(a, b):\n i = 0\n dic = {}\n while i < len(a):\n dic[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in dic:\n dic[b[j]] = True\n j = j + 1\n return dic","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":10684,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 14:57:07","func_code":"def union(x, y):\n answer = []\n check = {}\n i = 0\n while i < len(x):\n if not x[i] in check:\n answer.append(x[i])\n check[x[i]] = True\n elif not y[i] in check:\n answer.append(y[i])\n check[y[i]] = True\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":5129,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 14:57:11","func_code":"def union(a, b):\n seen = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if b[k] not in b:\n seen[b[k]] = True\n j = j + 1\n return","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":6135,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 14:57:26","func_code":"def union(x, y):\n answer = []\n check = {}\n i = 0\n while i < len(x):\n if not x[i] in check:\n answer.append(x[i])\n check[x[i]] = True\n elif not y[i] in check:\n answer.append(y[i])\n check[y[i]] = True\n i = i + 1\n return answer","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":34879,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:57:33","func_code":"def intersection(a, b):\n d = a + b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":21613,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 14:57:33","func_code":"def union(a, b):\n c = a + b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":26088,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-11-20 14:57:38","func_code":"def union(a, b):\n i = 0\n seen = []\n while i < len(a):\n if not a[i] in a:\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in b:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":672,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:57:51","func_code":"def intersection(a, b):\n i = 0\n s = []\n while i < len(a) and i < len(b):\n if a[i] in b:\n s.append(a[i])\n i = i + 1\n return s\n n = 0\n x = []\n while n < len(s):\n if s[n] not in s:\n x.append(s[n])\n n = n + 1\n return x","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":3937,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:57:51","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":32083,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:58:01","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":35883,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 14:58:01","func_code":"def intersection(a, b):\n i = 0\n s = []\n while i < len(a) and i < len(b):\n if a[i] in b:\n s.append(a[i])\n i = i + 1\n n = 0\n x = []\n while n < len(s):\n if s[n] not in s:\n x.append(s[n])\n n = n + 1\n return x","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":37792,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:58:58","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":39360,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:58:58","func_code":"def union(a, b):\n i = 0\n dic = {}\n while i < len(a):\n dic[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in dic:\n dic[b[j]] = True\n j = j + 1\n return dic","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":4099,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:58:58","func_code":"def union(a, b):\n i = 0\n dic = {}\n while i < len(a):\n dic[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in dic:\n dic[b[j]] = True\n j = j + 1\n return dic","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":19260,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2017-11-20 14:58:58","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":14028,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-11-20 14:59:14","func_code":"def intersection(a, b):\n int_seen = {}\n k = 0\n while k < len(a):\n if a[k] in b:\n int_seen[a[k]] = True\n k = k + 1\n return int_seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":13027,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-11-20 14:59:14","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if b[j] not in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":5503,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-11-20 14:59:14","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if b[j] not in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":33717,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2017-11-20 14:59:14","func_code":"def intersection(a, b):\n int_seen = {}\n k = 0\n while k < len(a):\n if a[k] in b:\n int_seen[a[k]] = True\n k = k + 1\n return int_seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":11485,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 14:59:21","func_code":"def union(x, y):\n answer = []\n check = {}\n i = 0\n while i < len(x):\n if not x[i] in check:\n answer.append(x[i])\n check[x[i]] = True\n i = i + 1\n j = 0\n while i < len(y):\n if not y[j] in check:\n answer.append(y[j])\n check[y[j]] = True\n j = j + 1\n return answer","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":11430,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 15:00:46","func_code":"def intersection(a, b):\n i = 0\n s = []\n while i < len(a) and i < len(b):\n if a[i] in b:\n s.append(a[i])\n i = i + 1\n n = 0\n prev = s[n]\n curr = s[n + 1]\n x = []\n while curr < len(s):\n if curr != prev:\n x.append(prev)\n n = n + 1\n return x","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":36194,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 15:00:46","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":8956,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-11-20 15:00:55","func_code":"def intersection(a, b):\n int_seen = {}\n f = 0\n while f < len(a):\n if a[f] in b:\n int_seen[a[f]] = True\n f = f + 1\n return int_seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":35180,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-11-20 15:00:55","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if b[j] not in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":29648,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-11-20 15:00:55","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if b[j] not in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":42237,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2017-11-20 15:00:55","func_code":"def intersection(a, b):\n int_seen = {}\n f = 0\n while f < len(a):\n if a[f] in b:\n int_seen[a[f]] = True\n f = f + 1\n return int_seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":40710,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 15:00:59","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < leb(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":21924,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 15:00:59","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":4106,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 15:01:09","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":21737,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 15:01:09","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":26278,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 15:01:09","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":27274,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2017-11-20 15:01:09","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":28928,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 15:01:10","func_code":"def union(a, b):\n seen = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in b:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":31438,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-11-20 15:01:15","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if b[j] not in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":25597,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-11-20 15:01:15","func_code":"def intersection(a, b):\n int_seen = {}\n k = 0\n while k < len(a):\n if a[k] in b:\n int_seen[a[k]] = True\n k = k + 1\n return int_seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":8014,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-11-20 15:01:15","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if b[j] not in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":28165,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2017-11-20 15:01:15","func_code":"def intersection(a, b):\n int_seen = {}\n k = 0\n while k < len(a):\n if a[k] in b:\n int_seen[a[k]] = True\n k = k + 1\n return int_seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":27181,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 15:01:21","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":3887,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 15:01:21","func_code":"def intersection(a, b):\n i = 0\n s = []\n while i < len(a) and i < len(b):\n if a[i] in b:\n s.append(a[i])\n i = i + 1\n n = 0\n prev = s[n]\n curr = s[n + 1]\n x = []\n while n - 1 < len(s):\n if curr != prev:\n x.append(prev)\n n = n + 1\n return x","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":37475,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 15:01:31","func_code":"def union(a, b):\n seen = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":40093,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-11-20 15:01:33","func_code":"def union(a, b):\n i = 0\n seen = []\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":7775,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 15:01:59","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":39500,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 15:02:37","func_code":"def intersection(a, b):\n seen = {}","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":10224,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 15:02:37","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":32336,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 15:03:20","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":34312,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 15:03:20","func_code":"def intersection(a, b):\n i = 0\n s = []\n while i < len(a) and i < len(b):\n if a[i] in b:\n s.append(a[i])\n i = i + 1\n return set(s)","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":37459,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 15:03:20","func_code":"def union(a, b):\n s = a + b\n return set(s)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":15699,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2017-11-20 15:03:20","func_code":"def intersection(a, b):\n i = 0\n s = []\n while i < len(a) and i < len(b):\n if a[i] in b:\n s.append(a[i])\n i = i + 1\n return set(s)","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":595,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:03:56","func_code":"def intersection(a, b):\n set = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in set:\n set[a[i]] = True\n i = i + 1\n return set","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":4773,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:03:56","func_code":"def union(a, b):\n set = {}\n i = 0\n while i < len(a):\n set[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in set:\n set[b[j]] = True\n j = j + 1\n return set","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":695,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 15:04:24","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":6725,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 15:04:24","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":28144,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 15:04:24","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":13732,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2017-11-20 15:04:24","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":31386,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-11-20 15:04:30","func_code":"def intersection(a, b):\n seen = []\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":11797,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-11-20 15:04:30","func_code":"def union(a, b):\n seen = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":15664,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-11-20 15:04:54","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":4782,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-11-20 15:04:54","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":42312,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-11-20 15:04:54","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":25598,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2017-11-20 15:04:54","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":12522,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:04:56","func_code":"def union(a, b):\n c = a, b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":11242,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:04:56","func_code":"def intersection(a, b):\n d = a + b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":34021,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:05:19","func_code":"def union(a, b):\n c = a, b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":9240,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:05:19","func_code":"def intersection(a, b):\n d = a + b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":41723,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:05:36","func_code":"def intersection(a, b):\n d = a + b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":11229,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:05:36","func_code":"def union(a, b):\n c = a and b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":35955,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-11-20 15:06:11","func_code":"def union(a, b):\n c = []\n ab = a + b\n for i in ab:\n if not i in c:\n c.append(i)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":31103,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-11-20 15:06:11","func_code":"def intersection(a, b):\n c = []\n for i in a:\n if i in a and i in b and not i in c:\n c.append(i)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":12503,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:06:36","func_code":"def union(a, b):\n c = a and b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":37993,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:06:36","func_code":"def union(a, b):\n c = a and b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":28103,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:06:36","func_code":"def union(a, b):\n c = a and b\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":31060,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:06:36","func_code":"def intersection(a, b):\n d = c - b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":17420,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:06:36","func_code":"def intersection(a, b):\n d = c - b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":42286,"user":"ac8b6b8f-d93c-46e5-8736-44e36e620908","date":"2017-11-20 15:06:36","func_code":"def intersection(a, b):\n d = c - b\n return d","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":33578,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-11-20 15:07:41","func_code":"def union(a, b):\n c = []\n ab = a + b\n for i in ab:\n if not i in c:\n c.append(i)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":31086,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-11-20 15:07:41","func_code":"def intersection(a, b):\n c = []\n for i in a:\n if i in b and not i in c:\n c.append(i)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":29987,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-11-20 15:07:41","func_code":"def intersection(a, b):\n c = []\n for i in a:\n if i in b and not i in c:\n c.append(i)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":30656,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2017-11-20 15:07:41","func_code":"def union(a, b):\n c = []\n ab = a + b\n for i in ab:\n if not i in c:\n c.append(i)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":2500,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:08:03","func_code":"def intersection(a, b):\n set = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in set:\n set[a[i]] = True\n i = i + 1\n return set","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":24541,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:08:03","func_code":"def union(a, b):\n set = {}\n i = 0\n while i < len(a):\n set[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in set:\n set[b[j]] = True\n j = j + 1\n return set","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":32548,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:08:39","func_code":"def union(a, b):\n set = {}\n i = 0\n while i < len(a):\n set[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in set:\n set[b[j]] = True\n j = j + 1\n return set","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":23135,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:08:39","func_code":"def intersection(a, b):\n set = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in set:\n set[a[i]] = True\n i = i + 1\n return set","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":36345,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-11-20 15:10:40","func_code":"def union(a, b):\n i = 0\n while i < len(a):\n if a != b:\n print(a, b)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":36939,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-11-20 15:11:35","func_code":"def union(a, b):\n c = []\n c = a - b\n seen = {}\n i = 0\n while i < len(c):\n if lines(c) not in seen:\n sys.stdout.write(lines[c])\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":36238,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-11-20 15:11:35","func_code":"def intersection(a, b):\n c = []\n c = a + b\n seen = {}\n i = 0\n while i < len(c):\n if lines(c) in seen:\n sys.stdout.write(lines[c])\n i = i + 1","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":2457,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-11-20 15:11:35","func_code":"def union(a, b):\n c = []\n c = a - b\n seen = {}\n i = 0\n while i < len(c):\n if lines(c) not in seen:\n sys.stdout.write(lines[c])\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":27006,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-11-20 15:11:35","func_code":"def union(a, b):\n c = []\n c = a - b\n seen = {}\n i = 0\n while i < len(c):\n if lines(c) not in seen:\n sys.stdout.write(lines[c])\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":21706,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-11-20 15:11:35","func_code":"def intersection(a, b):\n c = []\n c = a + b\n seen = {}\n i = 0\n while i < len(c):\n if lines(c) in seen:\n sys.stdout.write(lines[c])\n i = i + 1","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":13711,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-11-20 15:11:35","func_code":"def intersection(a, b):\n c = []\n c = a + b\n seen = {}\n i = 0\n while i < len(c):\n if lines(c) in seen:\n sys.stdout.write(lines[c])\n i = i + 1","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":7720,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:11:37","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":36472,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:11:37","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":24929,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-11-20 15:12:07","func_code":"def union(a, b):\n i = 0\n while i < len(a):\n if a != b:\n print(a, b)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":38286,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 15:12:46","func_code":"def union(x, y):\n answer = []\n check = {}\n i = 0\n while i < len(x):\n if not x[i] in check:\n answer.append(x[i])\n check[x[i]] = True\n i = i + 1\n j = 0\n while i < len(y):\n if not y[j] in check:\n answer.append(y[j])\n check[y[j]] = True\n j = j + 1\n return check","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":3842,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:13:01","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":89,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:13:01","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":33534,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:13:57","func_code":"def intersection():\n import sys\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i].rstrip()\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i].rstrip()\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dups = sorted(list(set(dups)))\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":16166,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:13:57","func_code":"def union(f1con, f2con):\n import sys\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i].rstrip()\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i].rstrip()\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dups = sorted(list(set(dups)))\n return dups","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":12338,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 15:14:25","func_code":"def union(x, y):\n answer = []\n check = {}\n i = 0\n while i < len(x):\n answer.append(x[i])\n check[x[i]] = True\n i = i + 1\n j = 0\n while i < len(y):\n if not y[j] in check:\n answer.append(y[j])\n check[y[j]] = True\n j = j + 1\n return answer","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":27297,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 15:16:40","func_code":"def union(x, y):\n answer = []\n check = {}\n i = 0\n while i < len(x):\n if not x[i] in check:\n answer.append(x[i])\n check[x[i]] = True\n i = i + 1\n j = 0\n while j < len(y):\n if not y[j] in check:\n answer.append(y[j])\n check[y[j]] = True\n j = j + 1\n return answer","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":35112,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:16:54","func_code":"def intersection():\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i].rstrip()\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i].rstrip()\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dups = sorted(list(set(dups)))\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":1525,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:16:54","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n union = sorted(list(set(union)))\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":37688,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:17:26","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i].rstrip()\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i].rstrip()\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dups = sorted(list(set(dups)))\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":23350,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:17:26","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n union = sorted(list(set(union)))\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":19355,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-20 15:17:41","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":23968,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-20 15:17:41","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":5899,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:18:34","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n union = sorted(list(set(union)))\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":20109,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:18:34","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i].rstrip()\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dups = sorted(list(set(dups)))\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":16898,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:18:50","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dups = sorted(list(set(dups)))\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":40534,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:18:50","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n union = sorted(list(set(union)))\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":13471,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:21:01","func_code":"def union(f1con, f2con):\n d1 = {}\n union = []\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n union.append(line)\n i = i + 1\n union = sorted(list(set(union)))\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":24779,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:21:01","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dups = sorted(list(set(dups)))\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":11071,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:21:47","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dups = sorted(list(set(dups)))\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":15933,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:21:47","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n union = sorted(list(set(union)))\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":20440,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-20 15:22:16","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":2797,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-20 15:22:16","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":28405,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-20 15:22:54","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":41390,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-20 15:22:54","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n k = 0\n while k < len(b):\n if not b[k] in seen:\n seen[b[k]] = True\n k = k + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":7934,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-20 15:22:54","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":34819,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2017-11-20 15:22:54","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":35613,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 15:24:25","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1]\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":false} {"submission_id":16591,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:24:45","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f2con):\n union.append(f2con[i])\n i = i + 1\n union = sorted(list(set(union)))\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":37934,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:24:45","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dups = sorted(list(set(dups)))\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":32947,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 15:24:49","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":true} {"submission_id":38786,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 15:24:49","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_iter","academic_year":2017,"module":"ca277","test":"assert reverse([])==[] and reverse([20, 10, 0, -10, -20])==[-20, -10, 0, 10, 20] and reverse(['toto', True, [10, 0, 9], 12.8, 6])==[6, 12.8, [10, 0, 9], True, 'toto']","description":"Iteratively reverse a list of elements.","correct":true} {"submission_id":36888,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 15:26:01","func_code":"def union(x, y):\n answer = []\n check = {}\n i = 0\n while i < len(x):\n if not x[i] in check:\n answer.append(x[i])\n check[x[i]] = True\n i = i + 1\n j = 0\n while j < len(y):\n if not y[j] in check:\n answer.append(y[j])\n check[y[j]] = True\n j = j + 1\n return answer","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":41277,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 15:26:01","func_code":"def intersection(x, y):\n check = {}\n i = 0\n while i < len(x):\n if x[i] in y and not x[i] in check:\n check[x[i]] = True\n i = i + 1\n return check","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":4267,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 15:26:01","func_code":"def intersection(x, y):\n check = {}\n i = 0\n while i < len(x):\n if x[i] in y and not x[i] in check:\n check[x[i]] = True\n i = i + 1\n return check","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":14345,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2017-11-20 15:26:01","func_code":"def union(x, y):\n answer = []\n check = {}\n i = 0\n while i < len(x):\n if not x[i] in check:\n answer.append(x[i])\n check[x[i]] = True\n i = i + 1\n j = 0\n while j < len(y):\n if not y[j] in check:\n answer.append(y[j])\n check[y[j]] = True\n j = j + 1\n return answer","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":19531,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:26:25","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dups = sorted(list(dict(dups)))\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":13018,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:26:25","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f2con):\n union.append(f2con[i])\n i = i + 1\n union = sorted(list(dict(union)))\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":27344,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-11-20 15:29:38","func_code":"def union(a, b):\n i = 0\n while i < len(a):\n if a != b:\n c = a, b\n return c\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":6730,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-11-20 15:30:47","func_code":"def union(a, b):\n i = 0\n while i < len(a):\n if a != b:\n c = (a, b) - (a + b)\n return c\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":36007,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 15:30:52","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":9513,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 15:30:52","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":9076,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 15:30:52","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":41459,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-20 15:30:52","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":28121,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:31:17","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":14580,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:31:17","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f2con):\n union.append(f2con[i])\n i = i + 1\n unionorg = {}\n i = 0\n while i != len(union):\n unionorg[union] = True\n i = i + 1\n for union in sorted(unionorg):\n if unionorg[union]:\n print(union)\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":9001,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-11-20 15:31:24","func_code":"def union(a, b):\n i = 0\n while i < len(a):\n if a != b:\n c = a, b\n return c\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":39594,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-11-20 15:34:09","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a != b:\n c = a, b\n return c\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":8672,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-11-20 15:34:09","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a != b:\n c = a, b\n return c\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":22922,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2017-11-20 15:34:09","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a != b:\n c = a, b\n return c\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":10837,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:35:01","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f2con):\n union.append(f2con[i])\n i = i + 1\n unionorg = {}\n i = 0\n while i != len(union):\n unionorg[union] = True\n i = i + 1\n dups = sorted(list(set(dups)))\n return '\/n', unionorg","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":18360,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:35:01","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":12182,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:35:33","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":13489,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:35:33","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f2con):\n union.append(f2con[i])\n i = i + 1\n unionorg = {}\n i = 0\n while i != len(union):\n unionorg[union[i]] = True\n i = i + 1\n dups = sorted(list(set(dups)))\n return '\/n', unionorg","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":11885,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:36:20","func_code":"def union(a, b):\n seen = {}\n c = []\n i = 0\n while i < len(a) and i < len(b):\n if a[i] or b[i] not in seen:\n seen[a[i]] = True\n seen[b[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":12340,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:36:29","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f2con):\n union.append(f2con[i])\n i = i + 1\n unionorg = {}\n i = 0\n while i != len(union):\n unionorg[union[i]] = True\n i = i + 1\n return '\/n', unionorg","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":14944,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:36:29","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":17131,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:38:44","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":2396,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:38:44","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f2con):\n union.append(f2con[i])\n i = i + 1\n unionorg = {}\n i = 0\n while i != len(union):\n unionorg[union[i]] = True\n i = i + 1\n pureunion = []\n for union in sorted(unionorg):\n if unionorg[union]:\n pureunion.append(union)\n return pureunion","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":35336,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2017-11-20 15:38:56","func_code":"def union(a, b):\n union = []\n i = 0\n while i < len(a) and i < len(b):\n if a[i] or b[i] not in seen:\n seen[a[i]] = True\n seen[b[i]] = True\n for number in seen:\n union.append(number)\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":35684,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-20 15:38:56","func_code":"def union(a, b):\n i = 0\n while i < len(a):\n if a != b:\n a.append(c)\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":40638,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:39:17","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f2con):\n union.append(f2con[i])\n i = i + 1\n unionorg = {}\n i = 0\n while i != len(union):\n unionorg[union[i]] = True\n i = i + 1\n pureunion = []\n for union in sorted(unionorg):\n if unionorg[union]:\n pureunion.append(union)\n return pureunion","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":40597,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:39:17","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dups = sorted(list(set(dups)))\n return dups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":8649,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-20 15:39:42","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a != b:\n a.append(c)\n i = i + 1\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":7363,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:40:16","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":13147,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:40:16","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":1470,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:40:16","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":36355,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:40:16","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":36285,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:40:16","func_code":"def union(a, b):\n seen = {}\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n j = 0\n while j < len(b):\n if not b[j] in seen:\n seen[b[j]] = True\n j = j + 1\n return seen","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":26770,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2017-11-20 15:40:16","func_code":"def intersection(a, b):\n seen = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in seen:\n seen[a[i]] = True\n i = i + 1\n return seen","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":30261,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2017-11-20 15:40:37","func_code":"def union(a, b):\n union = []\n i = 0\n while i < len(a) and i < len(b):\n if a[i] or b[i] not in seen:\n seen[a[i]] = True\n seen[b[i]] = True\n i = i + 1\n for number in seen:\n union.append(number)\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":28675,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:41:08","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f2con):\n union.append(f2con[i])\n i = i + 1\n unionorg = {}\n i = 0\n while i != len(union):\n unionorg[union[i]] = True\n i = i + 1\n pureunion = []\n for union in sorted(unionorg):\n if unionorg[union]:\n pureunion.append(union)\n return pureunion","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":14152,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:41:08","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dupsorg = {}\n i = 0\n while i != len(dups):\n dupsorg[dups[i]] = True\n i = i + 1\n puredups = []\n for dups in sorted(dupsorg):\n if dupsorg[dups]:\n puredups.append(dups)\n return puredups\n return puredups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":12909,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:41:08","func_code":"def union(f1con, f2con):\n union = []\n i = 0\n while i != len(f1con):\n union.append(f1con[i])\n i = i + 1\n i = 0\n while i != len(f2con):\n union.append(f2con[i])\n i = i + 1\n unionorg = {}\n i = 0\n while i != len(union):\n unionorg[union[i]] = True\n i = i + 1\n pureunion = []\n for union in sorted(unionorg):\n if unionorg[union]:\n pureunion.append(union)\n return pureunion","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":25019,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2017-11-20 15:41:08","func_code":"def intersection(f1con, f2con):\n d1 = {}\n i = 0\n while i != len(f1con):\n line = f1con[i]\n d1[line] = True\n i = i + 1\n dups = []\n i = 0\n while i != len(f2con):\n line = f2con[i]\n if line in list(d1.keys()):\n dups.append(line)\n i = i + 1\n dupsorg = {}\n i = 0\n while i != len(dups):\n dupsorg[dups[i]] = True\n i = i + 1\n puredups = []\n for dups in sorted(dupsorg):\n if dupsorg[dups]:\n puredups.append(dups)\n return puredups\n return puredups","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":34035,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:41:51","func_code":"def intersection(a, b):\n seen = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen:\n c.append(b[i])\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":7156,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:41:51","func_code":"def union(a, b):\n seen = {}\n c = []\n i = 0\n while i < len(a) and i < len(b):\n if a[i] or b[i] not in seen:\n seen[a[i]] = True\n seen[b[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":19032,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-20 15:42:00","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a != b:\n a.append(c)\n return c\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":32886,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-20 15:42:00","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a != b:\n a.append(c)\n return c\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":36082,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-20 15:42:00","func_code":"def union(a, b):\n i = 0\n c = []\n while i < len(a):\n if a != b:\n a.append(c)\n return c\n i = i + 1","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":9416,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:44:40","func_code":"def intersection(a, b):\n seen = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen:\n c.append(b[i])\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":356,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:44:40","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":41359,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2017-11-20 15:45:01","func_code":"def union(a, b):\n c = a + b\n union = []\n i = 0\n while i < len(a) and i < len(b):\n if c[i] not in seen:\n seen[c[i]] = True\n i = i + 1\n for number in seen:\n union.append(number)\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":7629,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2017-11-20 15:45:28","func_code":"def union(a, b):\n c = a + b\n union = []\n i = 0\n while i < len(c):\n if c[i] not in seen:\n seen[c[i]] = True\n i = i + 1\n for number in seen:\n union.append(number)\n return union","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":32632,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:50:36","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":38648,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:50:36","func_code":"def intersection(a, b):\n seen = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in a:\n seen[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":5905,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:51:45","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":39225,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:51:45","func_code":"def intersection(a, b):\n seen = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen:\n c.append(b[i])\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":16798,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:53:10","func_code":"def intersection(a, b):\n seen = {}\n appended = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in appended:\n c.append(b[i])\n appended[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":38109,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:53:10","func_code":"def intersection(a, b):\n seen = {}\n appended = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in appended:\n c.append(b[i])\n appended[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":15948,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:53:10","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":5846,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:53:10","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":6525,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:53:10","func_code":"def intersection(a, b):\n seen = {}\n appended = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in appended:\n c.append(b[i])\n appended[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":22140,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-20 15:53:10","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":3944,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-11-21 16:03:39","func_code":"def union(a, b):\n c = set(a + b)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":31914,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-11-21 16:12:50","func_code":"def union(a, b):\n c = set(a + b)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":24627,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-11-21 16:12:50","func_code":"def intersection(a, b):\n c = []\n for item in a:\n if item in b:\n c.append(item)\n return set(c)","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":20749,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-11-21 16:13:00","func_code":"def intersection(a, b):\n c = []\n for item in a:\n if item in b:\n c.append(item)\n return set(c)","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":22825,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-11-21 16:13:00","func_code":"def union(a, b):\n c = set(a + b)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":216,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-11-21 16:24:26","func_code":"def intersection(a, b):\n c = []\n for item in a:\n if item in b and item not in c:\n c.append(item)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":7128,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-11-21 16:24:26","func_code":"def union(a, b):\n c = []\n for item in a:\n if item not in c:\n c.append(item)\n for item in b:\n if item not in c:\n c.append(item)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":32392,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-11-21 16:25:01","func_code":"def intersection(a, b):\n c = []\n for item in a:\n if item in b and item not in c:\n c.append(item)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":15903,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-11-21 16:25:01","func_code":"def intersection(a, b):\n c = []\n for item in a:\n if item in b and item not in c:\n c.append(item)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":5221,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-11-21 16:25:01","func_code":"def union(a, b):\n c = []\n for item in a:\n if item not in c:\n c.append(item)\n for item in b:\n if item not in c:\n c.append(item)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":12132,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2017-11-21 16:25:01","func_code":"def union(a, b):\n c = []\n for item in a:\n if item not in c:\n c.append(item)\n for item in b:\n if item not in c:\n c.append(item)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":13821,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-22 11:00:38","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":27941,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-22 11:00:38","func_code":"def intersection(a, b):\n seen = {}\n appended = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in appended:\n c.append(b[i])\n appended[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":13428,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-22 11:00:38","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":40200,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2017-11-22 11:00:38","func_code":"def intersection(a, b):\n seen = {}\n appended = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in appended:\n c.append(b[i])\n appended[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":32450,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:05:54","func_code":"def intersection(a, b):\n seen = {}\n append = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in append:\n c.append(b[i])\n append[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":29858,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:05:54","func_code":"def union(a, b):\n union = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":33726,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:06:16","func_code":"def union(a, b):\n union = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":14781,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:06:16","func_code":"def intersection(a, b):\n seen = {}\n append = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in append:\n c.append(b[i])\n append[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":27144,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-11-22 11:06:33","func_code":"def intersection(a, b):\n seen = {}\n appended = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in appended:\n c.append(b[i])\n appended[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":4395,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-11-22 11:06:33","func_code":"def union(a, b):\n a = a - b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":11634,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-11-22 11:06:33","func_code":"def intersection(a, b):\n seen = {}\n appended = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in appended:\n c.append(b[i])\n appended[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":29658,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2017-11-22 11:06:33","func_code":"def union(a, b):\n a = a - b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":10494,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:06:59","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":25725,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:06:59","func_code":"def intersection(a, b):\n seen = {}\n append = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in append:\n c.append(b[i])\n append[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":38180,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:09:28","func_code":"def union(a, b):\n union = a + b\n seen = {}\n c = []\n i = 0\n while i < len(union):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":19791,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:09:28","func_code":"def intersection(a, b):\n seen = {}\n append = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in append:\n c.append(b[i])\n append[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":23476,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:09:58","func_code":"def intersection(a, b):\n seen = {}\n append = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in append:\n c.append(b[i])\n append[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":26590,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:09:58","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":20750,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:09:58","func_code":"def intersection(a, b):\n seen = {}\n append = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in append:\n c.append(b[i])\n append[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":7055,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2017-11-22 11:09:58","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":20436,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-11-22 12:38:34","func_code":"def union(a, b):\n i = 0\n while i < len(a) and a[i] != b:\n i = i + 1\n return i < len(a)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":15324,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-11-22 12:38:55","func_code":"def union(a, b):\n i = 0\n while i < len(a) and a[i] != b:\n i = i + 1\n return i < len(a)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":14901,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-11-22 12:38:55","func_code":"def union(a, b):\n i = 0\n while i < len(a) and a[i] != b:\n i = i + 1\n return i < len(a)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":40003,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2017-11-22 12:38:55","func_code":"def union(a, b):\n i = 0\n while i < len(a) and a[i] != b:\n i = i + 1\n return i < len(a)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":11092,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-11-22 14:55:01","func_code":"def union(a, b):\n a = a + b\n seen = {}\n c = []\n i = 0\n while i < len(a):\n if a[i] not in seen:\n seen[a[i]] = True\n i = i + 1\n for number in seen:\n c.append(number)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":22693,"user":"b8415cb6-c612-4985-9211-908831b3834e","date":"2017-11-22 14:55:01","func_code":"def intersection(a, b):\n seen = {}\n appended = {}\n c = []\n i = 0\n while i < len(a):\n seen[a[i]] = True\n i = i + 1\n i = 0\n while i < len(b):\n if b[i] in seen and b[i] not in appended:\n c.append(b[i])\n appended[b[i]] = True\n i = i + 1\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":211,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:47:41","func_code":"def union(a, b):\n un = {}\n i = 0\n while i < len(a):\n un[a[i]] = True\n i = i + 1\n h = 0\n while i < len(b):\n un[b[h]] = True\n h = h + 1\n print(un)","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":15848,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:47:41","func_code":"def intersection(a, b):\n int = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in int:\n int[a[i]] = True\n i = i + 1\n print(int)","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":1565,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:48:42","func_code":"def union(a, b):\n un = {}\n i = 0\n while i < len(a):\n un[a[i]] = True\n i = i + 1\n h = 0\n while i < len(b):\n un[b[h]] = True\n h = h + 1\n return un","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":23285,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:48:42","func_code":"def intersection(a, b):\n int = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in int:\n int[a[i]] = True\n i = i + 1\n return int","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":18135,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:50:12","func_code":"def intersection(a, b):\n int = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in int:\n int[a[i]] = True\n i = i + 1\n return int","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":25541,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:50:12","func_code":"def union(a, b):\n un = {}\n i = 0\n while i < len(a):\n un[a[i]] = True\n i = i + 1\n h = 0\n while i < len(b):\n if not b[h] in un:\n un[b[h]] = True\n h = h + 1\n return un","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":6764,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:51:51","func_code":"def intersection(a, b):\n inter = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in inter:\n inter[a[i]] = True\n i = i + 1\n return inter","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":23282,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:51:51","func_code":"def union(a, b):\n un = {}\n i = 0\n while i < len(a):\n un[a[i]] = True\n i = i + 1\n h = 0\n while i < len(b):\n if not b[h] in un:\n un[b[h]] = True\n h = h + 1\n return un","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":6808,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:52:35","func_code":"def union(a, b):\n un = {}\n i = 0\n while i < len(a):\n un[a[i]] = True\n i = i + 1\n j = 0\n while i < len(b):\n if not b[j] in un:\n un[b[j]] = True\n j = j + 1\n return un","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":11353,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:52:35","func_code":"def union(a, b):\n un = {}\n i = 0\n while i < len(a):\n un[a[i]] = True\n i = i + 1\n j = 0\n while i < len(b):\n if not b[j] in un:\n un[b[j]] = True\n j = j + 1\n return un","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":18755,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:52:35","func_code":"def intersection(a, b):\n inter = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in inter:\n inter[a[i]] = True\n i = i + 1\n return inter","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":39964,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:52:35","func_code":"def intersection(a, b):\n inter = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in inter:\n inter[a[i]] = True\n i = i + 1\n return inter","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":9768,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:52:35","func_code":"def union(a, b):\n un = {}\n i = 0\n while i < len(a):\n un[a[i]] = True\n i = i + 1\n j = 0\n while i < len(b):\n if not b[j] in un:\n un[b[j]] = True\n j = j + 1\n return un","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":false} {"submission_id":29543,"user":"3aed57e0-c2a2-49b2-afaf-23d3d77478fb","date":"2017-11-23 18:52:35","func_code":"def intersection(a, b):\n inter = {}\n i = 0\n while i < len(a):\n if a[i] in b and not a[i] in inter:\n inter[a[i]] = True\n i = i + 1\n return inter","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":23469,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:15:47","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13680,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:16:31","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25409,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:16:31","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":19767,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:22:17","func_code":"def square_perimeter(n):\n sp = n + n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":37671,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:22:17","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":38067,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:22:17","func_code":"def rectangle_perimeter(n, m):\n rp = 2 * (n + m)\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":35796,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:22:17","func_code":"def circle_circumference(n):\n cc = 2 * 3.141 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":41186,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:22:17","func_code":"def circle_area(n):\n ca = 3.141 * n ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":4655,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:22:52","func_code":"def circle_area(n):\n ca = 3.141 * n ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":10878,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:22:52","func_code":"def circle_circumference(n):\n cc = 2 * 3.141 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":false} {"submission_id":37214,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:22:52","func_code":"def rectangle_perimeter(n, m):\n rp = 2 * (n + m)\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":23099,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:22:52","func_code":"def square_perimeter(n):\n sp = 4 * n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11589,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:22:52","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33977,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:23:22","func_code":"def circle_area(n):\n ca = 3.14 * n ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":38632,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:23:22","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":7181,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:23:22","func_code":"def rectangle_perimeter(n, m):\n rp = 2 * (n + m)\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":3184,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:23:22","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":29784,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:23:22","func_code":"def square_perimeter(n):\n sp = 4 * n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":14475,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:28:42","func_code":"def rectangle_perimeter(n, m):\n rp = 2 * (n + m)\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":22745,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:28:42","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":19575,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:28:42","func_code":"def circle_area(n):\n ca = 3.14 * n ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":16566,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:28:42","func_code":"def circle_circumference(n):\n cc = 2 * 3.14 * n\n return cc","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":14666,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:28:42","func_code":"def square_perimeter(n):\n sp = 4 * n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":37036,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:28:42","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41045,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:28:42","func_code":"def square_area(n):\n sa = n * n\n return sa","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":41432,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:28:42","func_code":"def circle_area(n):\n ca = 3.14 * n ** 2\n return ca","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":9817,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:28:42","func_code":"def square_perimeter(n):\n sp = 4 * n\n return sp","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":16426,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:28:42","func_code":"def rectangle_perimeter(n, m):\n rp = 2 * (n + m)\n return rp","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":29406,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:57:50","func_code":"def find_position_of_smallest(a, i):\n j = i\n while i < len(a):\n if a[i] < a[j]:\n j = i\n i = i + 1\n return j\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n k = find_position_of_smallest(a, i)\n swap(a, i, k)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":4011,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2017-11-27 09:57:50","func_code":"def find_position_of_smallest(a, i):\n j = i\n while i < len(a):\n if a[i] < a[j]:\n j = i\n i = i + 1\n return j\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n k = find_position_of_smallest(a, i)\n swap(a, i, k)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":34398,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:15:09","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34824,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:18:05","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":13198,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:18:10","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":33285,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:18:13","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":41523,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:18:13","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":3835,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:21:33","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":15168,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:21:33","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35994,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:22:02","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":38386,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:22:02","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":24234,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:23:33","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":31712,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:23:33","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":22492,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:23:33","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":30040,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:23:33","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":24622,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:23:37","func_code":"def swap(a, i, j):\n t = a[i]\n a[i] = a[j]\n a[j] = t\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":31881,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:29:58","func_code":"def swap(a, i, j):\n t = a[i]\n a[i] = a[j]\n a[j] = t\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38930,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:29:58","func_code":"def swap(a, i, j):\n t = a[i]\n a[i] = a[j]\n a[j] = t\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":2003,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:31:38","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":4793,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:31:55","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":33821,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:32:06","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":28264,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:33:29","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":37535,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-27 13:33:29","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":37618,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:05:48","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":29076,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:05:48","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":9990,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:06:17","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10541,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:06:17","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":31435,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:06:35","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":21346,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:06:35","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":14229,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:06:47","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":19082,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:06:47","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":18970,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:06:59","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":22047,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:06:59","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":29977,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:06:59","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35965,"user":"df8dd1dd-a7c8-46c0-b89f-ec170a81f08a","date":"2017-11-28 11:06:59","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":14068,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:01:53","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":40208,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:01:53","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25039,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:05:10","func_code":"def double(n):\n m = n + n\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":20485,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:05:10","func_code":"def double(n):\n m = n + n\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17463,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:07:13","func_code":"def area(r):\n return 3.141 * (r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":23090,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:07:13","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":7916,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:08:25","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":41590,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:08:25","func_code":"def area(r):\n return pi * (r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":11599,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:08:25","func_code":"def area(r):\n return pi * (r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":34470,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:08:25","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":8626,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:09:38","func_code":"def circumference(r):\n c = 2 * 3.141 * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":7714,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:09:38","func_code":"def area(r):\n a = 3.141 * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":36365,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:10:48","func_code":"def area(r):\n pi = 3.141\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":18061,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:10:48","func_code":"def circumference(r):\n pi = 3.141\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":22858,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:11:46","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12404,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:11:46","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":3349,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:11:46","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":14456,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:11:46","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":11364,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 12:14:53","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":7755,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 12:15:13","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":37367,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 12:15:13","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":40522,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:18:29","func_code":"def reverse(a):\n j = 0\n i = len(a) - 1\n while j < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n j = j + 1\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39932,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:18:37","func_code":"def double(n):\n m = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":35811,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:19:16","func_code":"def double(n):\n n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":12470,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:19:17","func_code":"def double(n):\n n = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":15081,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:19:17","func_code":"def double(n):\n n = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":10255,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:19:40","func_code":"def double(n):\n n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":13440,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:20:09","func_code":"def double(x):\n return x * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":33762,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:20:09","func_code":"def double(x):\n return x * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":18985,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:21:05","func_code":"def double(n):\n n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":25435,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:21:30","func_code":"def double(n):\n n = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17845,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:21:30","func_code":"def double(n):\n n = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":33280,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 12:21:36","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":18404,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 12:21:36","func_code":"def circumference(r):\n x = pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":20802,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:22:21","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":40219,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:22:21","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":6094,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:22:47","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":9204,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:22:47","func_code":"def area(r):\n 2 * 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":16850,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:22:49","func_code":"def double(n):\n n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":1816,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 12:22:53","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36685,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 12:22:53","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":41593,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 12:22:53","func_code":"def circumference(r):\n x = pi * (2 * r)\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":18362,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 12:22:53","func_code":"def circumference(r):\n x = pi * (2 * r)\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":5050,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:23:08","func_code":"def circumference(n):\n circumference = 2 * pi * n\n return circumference","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":13401,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:23:08","func_code":"def area(n):\n area = 2 * pi * n ** 2\n return area","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35633,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:23:17","func_code":"def area(r):\n return 2 * 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":31225,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:23:17","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":23950,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:23:48","func_code":"def area(n):\n area = pi * n ** 2\n return area","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":31739,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:23:48","func_code":"def area(n):\n area = pi * n ** 2\n return area","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":13456,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:23:48","func_code":"def circumference(n):\n circumference = 2 * pi * n\n return circumference","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":10915,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:23:48","func_code":"def circumference(n):\n circumference = 2 * pi * n\n return circumference","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":34218,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:23:51","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":10095,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:23:51","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":33204,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:24:03","func_code":"def double():\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":27335,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:24:27","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25147,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:24:27","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34198,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:24:39","func_code":"def area(r):\n n = (3.141 * r) ** 2\n return n","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":41853,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:24:39","func_code":"def circumference(r):\n n = 2 * 3.141 * r\n return n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":13800,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:24:53","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10356,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:24:53","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":31614,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:24:53","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4335,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:24:53","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":1921,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:25:02","func_code":"def area(r):\n n = 3.141 * r ** 2\n return n","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":2658,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:25:02","func_code":"def circumference(r):\n n = 2 * 3.141 * r\n return n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":23236,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:25:15","func_code":"def circumference(r):\n c = r ** 2 * 3.141\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":21293,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:25:15","func_code":"def area(r):\n a = r ** 2 * 3.141","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":15057,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:25:27","func_code":"def swap(a, i, j):\n while j < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n j = j + 1\n i = i + 1\n return a\n\n\ndef reverse(a):\n j = 0\n i = len(a) - 1\n print(swap(a, i, j))","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":21530,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:25:32","func_code":"def area(r):\n a = r ** 2 * 3.141","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4269,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:25:32","func_code":"def circumference(r):\n c = r * 2 * 3.141\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":29238,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:25:49","func_code":"def swap(a, i, j):\n while j < len(a):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n j = j + 1\n i = i + 1\n return a\n\n\ndef reverse(a):\n j = 0\n i = len(a) - 1\n print(swap(a, i, j))","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":31343,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:25:55","func_code":"def circumference(r):\n n = 2 * pi * r\n return n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":21777,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:25:55","func_code":"def area(r):\n n = pi * r ** 2\n return n","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":27119,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:25:55","func_code":"def area(r):\n n = pi * r ** 2\n return n","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":888,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:25:55","func_code":"def circumference(r):\n n = 2 * pi * r\n return n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":21394,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:26:47","func_code":"def circumference(r):\n c = r * 2 * 3.141\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":34119,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:26:47","func_code":"def area(r):\n a = r ** 2 * 3.141\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":26332,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:27:27","func_code":"def swap(a, i, j):\n while j < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n j = j + 1\n i = i - 1\n return a\n\n\ndef reverse(a):\n j = 0\n i = len(a) - 1\n print(swap(a, i, j))","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":33572,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:27:39","func_code":"def area(r):\n pi = 3.141\n a = r ** 2 * pi\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":22896,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:27:39","func_code":"def circumference(r):\n pi = 3.141\n c = r * 2 * pi\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":36850,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:28:02","func_code":"def circumference(r):\n c = r * 2 * pi\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":37554,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:28:02","func_code":"def area(r):\n a = r ** 2 * pi\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10892,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:28:02","func_code":"def circumference(r):\n c = r * 2 * pi\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":5616,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:28:02","func_code":"def area(r):\n a = r ** 2 * pi\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":37211,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:29:36","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[i]\n a[i] = a[-i]\n a[-i] = tmp","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":10625,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:29:57","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[i]\n a[i] = a[-i]\n a[-i] = tmp\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11388,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:30:18","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, a[i], a[j])\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20830,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 12:30:38","func_code":"def swap(a, i, j):\n while j < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n j = j + 1\n i = i - 1\n return a\n\n\ndef reverse(a):\n j = 0\n i = len(a) - 1\n print(swap(a, i, j))","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":33078,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:31:26","func_code":"def area(r):\n a = 3.141 * r * r\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35829,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:32:07","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = a[len(a) - i]\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":17920,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:32:10","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":16097,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:32:14","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":24003,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:32:14","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":27306,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:32:15","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[-i]\n a[-i] = tmp\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":31988,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:32:19","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, a[i], a[j])\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30214,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:32:24","func_code":"def circumference(r):\n c = 2 * 3.141 * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":39707,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:32:24","func_code":"def area(r):\n a = 3.141 * r * r\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":32699,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:32:31","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = a[len(a) - 1 - i]\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":42328,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:33:02","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = a[len(a) - i - 1]\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":379,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:33:04","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":10592,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:33:04","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":37658,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:33:14","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a)\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":518,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:33:14","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - 1 - i] = tmp\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":10578,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:33:15","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":9425,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:33:15","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":31082,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:33:58","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, a[i], a[j])\n i = i + 1\n j = len(a) - i - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":33799,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:34:00","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":18239,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:34:00","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":19583,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:34:05","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":7355,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:34:05","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":6042,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:34:05","func_code":"def area(r):\n a = pi * r * r\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":34359,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:34:05","func_code":"def area(r):\n a = pi * r * r\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36140,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:34:15","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = a[len(a) - i - 1]\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":6992,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:34:31","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":32841,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:34:31","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4357,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:34:31","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":14518,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:34:31","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":11513,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:34:50","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":20163,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:34:50","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":1335,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:35:15","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = a[len(a) - i - 1]\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36538,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:35:19","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":19954,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:35:19","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":34736,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:35:19","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":27599,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:35:19","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":14550,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:35:54","func_code":"def circumference(r):\n return 2 * 3.14 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":10608,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:35:54","func_code":"def area(r):\n (3.14 * r) ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":5806,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:35:55","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":7608,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:36:24","func_code":"def area():\n return (r * 3.14) ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":38906,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:36:24","func_code":"def circumference(r):\n return r * (2 * 3.14)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":16672,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:36:39","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = a[len(a) - i - 1]\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":21981,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:36:52","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":38327,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:36:52","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":28063,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:37:06","func_code":"def area(r):\n (pi * r) ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20284,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:37:06","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":4257,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:37:14","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39465,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:37:14","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12390,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:37:18","func_code":"def circumference(r):\n return r * (2 * pi)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":23024,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:37:18","func_code":"def area(r):\n return (r * pi) ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":7728,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:37:39","func_code":"def area(r):\n pi * r * (pi * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":32785,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:37:39","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":23907,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:38:02","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":39527,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:38:02","func_code":"def circumference(r):\n return r * (2 * pi)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":17962,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:38:02","func_code":"def circumference(r):\n return r * (2 * pi)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":27685,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:38:02","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":11470,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:38:07","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":41758,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:38:07","func_code":"def area(r):\n return (pi * r) ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4035,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:38:14","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":25775,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:38:14","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":2997,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2017-11-28 12:38:19","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17279,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2017-11-28 12:38:19","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":23637,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:38:29","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":30382,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2017-11-28 12:38:29","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":9470,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:38:39","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":3456,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:38:39","func_code":"def area(r):\n return pi * r * (pi * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20338,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 12:39:45","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":28701,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 12:39:45","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":14583,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:39:52","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":35254,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:39:52","func_code":"def area(r):\n return (pi * r) ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":31834,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:39:53","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a)\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":1248,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:39:54","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n temp = a[p]\n a[p] = a[i]\n a[i] = temp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40840,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2017-11-28 12:39:54","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n temp = a[p]\n a[p] = a[i]\n a[i] = temp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41535,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:39:59","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n a[i] = a[len(a) - 1 - i]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8754,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 12:40:06","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":23403,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 12:40:06","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25940,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:40:23","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n a[i] = a[len(a) - 1 - i]\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36891,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:40:35","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":37408,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:40:35","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":33989,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:40:35","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":16418,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 12:40:35","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":42121,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:41:00","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[i]\n a[i] = a[len(a) - 1 - i]\n a[len(a) - 1 - i] = tmp\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13956,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:41:13","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a)\n while i < len(a) \/ 2:\n func_reverse.swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":5776,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 12:41:13","func_code":"def double(n):\n n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":36864,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:41:31","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a)\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":16367,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:42:12","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n i = 0\n while i < len(a):\n print(a[i])\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":36195,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 12:42:53","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25032,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 12:42:53","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":11397,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:43:18","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n i = 0\n while i < len(a):\n print(a[i])\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":6404,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:43:59","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n i = 0\n while i < len(a):\n print(a[i])\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":19300,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:44:21","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n i = 0\n while i < len(a):\n print(a)\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":2207,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:44:42","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n i = 0\n while i < len(a):\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":7565,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2017-11-28 12:44:42","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n i = 0\n while i < len(a):\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":37723,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:44:45","func_code":"def reverse(a):\n i = 0\n j = len(a)\n while i < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":16600,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:45:14","func_code":"def reverse(a):\n i = 0\n j = len(a)\n while i < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":32086,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:47:04","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = j + 1\n while i != 0 and j < len(a):\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":15432,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:47:06","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[i]\n a[i] = a[len(a) - 1 - i]\n a[len(a) - 1 - i] = tmp\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":10693,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 12:47:17","func_code":"def circumference(r):\n return 3.141 * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":6591,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 12:47:17","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":7915,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 12:47:19","func_code":"def area(r):\n return 3.141 * (r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":18944,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 12:47:23","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":20579,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:47:45","func_code":"def reverse(a):\n i = 0\n j = len(a)\n if j % 2 == 0:\n while i < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1\n else:\n while i < len(a) \/ 2 + 1:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":26853,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:47:51","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[len(a) - 1 - i]\n a[len(a) - 1 - i] = a[i]\n a[i] = tmp\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":40900,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:47:56","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i != 0 and j < len(a):\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37930,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 12:48:20","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":25835,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 12:48:20","func_code":"def area(r):\n return pi * (r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":37242,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 12:48:20","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":14210,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:48:54","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[len(a) - 1 - i]\n a[len(a) - 1 - i] = a[i]\n a[i] = tmp\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":29184,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 12:49:18","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n z = 0\n x = len(a)\n if len(a) % 2 != 0:\n while z < len(a) \/ 2:\n swap(a, z, x)\n z = z + 1\n x = x - 1\n else:\n while z < len(a) \/ 2 + 1:\n swap(a, z, x)\n z = z + 1\n x = x - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":21091,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:49:26","func_code":"def reverse(a):\n i = 0\n j = len(a)\n while i < len(a):\n tmp = a[j - i]\n a[j - i] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":7167,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:50:03","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i != 0 and j < len(a):\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":23567,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:50:12","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":12012,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:50:12","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":11826,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 12:50:49","func_code":"def area(r):\n return r * (r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":38214,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 12:50:49","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":31565,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:51:14","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i != 0 and j < len(a) and i != j:\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":6542,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 12:51:25","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":28585,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 12:51:25","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":26262,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:51:36","func_code":"def reverse(a):\n i = 0\n j = len(a)\n if len(a) == 1:\n return a\n else:\n while i < len(a):\n tmp = a[j - i]\n a[j - i] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":34696,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 12:51:52","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[len(a) - i]\n a[len(a) - i] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36603,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 12:51:56","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33675,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 12:51:56","func_code":"def area(r):\n return pi * (r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":1321,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 12:51:56","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":39158,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 12:51:56","func_code":"def area(r):\n return pi * (r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4104,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:52:25","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a):\n swap(a, i, j)\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":34278,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 12:52:38","func_code":"def reverse(a):\n i = 0\n j = len(a)\n if len(a) == 1:\n return a\n else:\n while i < len(a):\n tmp = a[j - i - 1]\n a[j - i - 1] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":6321,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:52:45","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a):\n swap(a, i, j)\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":28159,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 12:52:46","func_code":"def area(r):\n return (pi * r) ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36642,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 12:52:46","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":9977,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:53:34","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38521,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:53:34","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38845,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:53:46","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = j + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":38844,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:53:48","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[smal]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":10280,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 12:53:50","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":7350,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:53:59","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[small]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":19924,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 12:53:59","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[small]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34259,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:54:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41754,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 12:54:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":20583,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:57:07","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i != 0 and j < len(a) and j != i:\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":16022,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:58:41","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":24682,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:59:14","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":5064,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2017-11-28 12:59:14","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":20857,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 12:59:41","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i != 0 and j < len(a):\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":29692,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:00:57","func_code":"def circumference(r):\n return r * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":38988,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:00:57","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":34718,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:01:10","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i != 0 and j < len(a) and j != i:\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":25305,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:01:37","func_code":"def circumference(r):\n return r * (2)(3.141)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":15139,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:01:37","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":10253,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 13:02:01","func_code":"def double(n):\n m = 2 * n\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":42298,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 13:02:01","func_code":"def double(n):\n m = 2 * n\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":40423,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:02:14","func_code":"def circumference(r):\n return r * (2 * 3.141)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":17272,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:02:14","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":34487,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 13:04:12","func_code":"def double(n):\n m = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":23529,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 13:04:34","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":11326,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 13:04:34","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":18861,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 13:04:59","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n j = len(a) - i - 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20911,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:05:41","func_code":"def double(n):\n print(n * 2)","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":23666,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-28 13:05:47","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":11619,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-28 13:05:47","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":28748,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-28 13:05:47","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":35073,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:05:49","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":730,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:05:49","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":28788,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 13:07:32","func_code":"def area(r):\n a = (3.141 * r) ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":30021,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 13:07:32","func_code":"def circumference(r):\n c = 2 * 3.141 * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":6524,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 13:08:18","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":23665,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 13:08:18","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":24633,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:08:22","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12734,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:08:22","func_code":"def circumference(r):\n return r * (2 * pi)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33620,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:08:22","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":36695,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:08:41","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":2099,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:08:41","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":32511,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:08:41","func_code":"def circumference(r):\n return r * (2 * pi)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":4094,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 13:08:41","func_code":"def circumference(r):\n return r * (2 * pi)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":27959,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 13:08:48","func_code":"def circumference(r):\n c = 2 * 3.141 * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":10710,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 13:08:48","func_code":"def area(r):\n a = (3.141 * r) ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":28011,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 13:08:59","func_code":"def area(r):\n area = 3.141 * r ** 2\n return area","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":10829,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 13:08:59","func_code":"def circumference(r):\n cir = 2 * 3.141 * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":1640,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:09:17","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":16942,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:09:17","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":20450,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 13:09:34","func_code":"def circumference(r):\n cir = 2 * pi * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":8181,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 13:09:34","func_code":"def circumference(r):\n cir = 2 * pi * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":11252,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 13:09:34","func_code":"def area(r):\n area = pi * r ** 2\n return area","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":34318,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 13:09:34","func_code":"def area(r):\n area = pi * r ** 2\n return area","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":37034,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:09:37","func_code":"def double(n):\n print(n * 2)","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":4917,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:09:56","func_code":"def circumference(r):\n c = 2 * 3.141 * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":1991,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:09:56","func_code":"def area(r):\n a = 3.141 * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":33579,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:10:00","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":31326,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:10:00","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":16403,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 13:10:03","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":6228,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 13:10:03","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":15020,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 13:10:03","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":14491,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 13:10:03","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26144,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 13:10:07","func_code":"def area(r):\n 3.141 * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":3235,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 13:10:07","func_code":"def circumference(r):\n 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":19382,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:10:23","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[i] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":36270,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 13:10:32","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":25208,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 13:10:32","func_code":"def area(r):\n return 3.141 * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10248,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:10:42","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33259,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:10:42","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":41824,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:10:42","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":27427,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:10:42","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":18482,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 13:11:13","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":23610,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 13:11:13","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":13885,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 13:11:13","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":25563,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 13:11:13","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":21760,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:11:18","func_code":"def double(n):\n print(n * 2)","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":20246,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:11:51","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":15536,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:11:51","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":37187,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:12:03","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[i] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":4219,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:12:43","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[i] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40033,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:12:47","func_code":"def circumference(r):\n return 2 * r * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":17770,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:12:47","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":33470,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 13:13:13","func_code":"def selection_sort(a):\n i = 0\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":20526,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:13:28","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i >= 0 and j < len(a) and j != i:\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":32988,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:13:56","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i > 0 and j < len(a) and j != i:\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":31076,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:14:52","func_code":"def circumference(r):\n return 2 * r * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":28638,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:14:52","func_code":"def area(r):\n return 2 * r * 3.141","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":15522,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:15:32","func_code":"def reverse(a):\n i = len(a) - 1\n j = 0\n while i > 0 and j < len(a) and j != i:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":14966,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:15:42","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":6040,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:15:42","func_code":"def circumference(r):\n return 2 * r * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":10657,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:15:46","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":10378,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:15:46","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":32334,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:15:48","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":34646,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:15:48","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":17205,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:15:52","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":24933,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:15:52","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":36143,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:16:27","func_code":"def circumference(r):\n return 2 * r * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":7252,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:16:27","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":5528,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:16:29","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":28746,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:16:29","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":31550,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:16:29","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":30809,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:16:29","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":39679,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:16:31","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":19114,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:16:31","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":30398,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:16:31","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":38458,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:16:31","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":19043,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:16:43","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":1079,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:16:43","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20457,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:16:43","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33992,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:16:43","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":22250,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:17:27","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20733,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:17:34","func_code":"def area(r):\n return float(3.141) * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":5642,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:17:34","func_code":"def circumference(r):\n return 2 * r * float(3.141)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":13755,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:18:36","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":22683,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:18:57","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12536,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:18:57","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13479,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:19:29","func_code":"def area(r):\n return float(3.141 * r ** 2)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":34124,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:19:29","func_code":"def circumference(r):\n return float(2 * r * 3.141)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":35781,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:19:43","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[i] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":16063,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:19:54","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":6969,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:20:31","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":17577,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:20:31","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":29294,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 13:20:40","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":41136,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:20:55","func_code":"def area(r):\n return float(p * r ** 2)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":37085,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:20:55","func_code":"def circumference(r):\n return float(2 * r * p)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":35714,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:21:03","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i != 0 and j < len(a) and j != i:\n swap()\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":1111,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:21:34","func_code":"def area(r):\n return float(pi * r ** 2)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":1203,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:21:34","func_code":"def circumference(r):\n return float(2 * r * pi)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33174,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:21:37","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[i] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":39413,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:22:11","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[i] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[p]\n a[p] = a[i]\n a[p] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":13332,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 13:22:18","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":36870,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 13:22:18","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":32430,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 13:22:18","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36557,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 13:22:18","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":29853,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:22:22","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[i] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":5234,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:22:26","func_code":"def circumference(r):\n return float(2 * r * pi)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":27632,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:22:26","func_code":"def area(r):\n return float(pi * r ** 2)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17381,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:22:53","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":8890,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:22:55","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":8675,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 13:22:55","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":31348,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 13:23:06","func_code":"def double(n):\n y = n * 2\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":1631,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 13:23:06","func_code":"def double(n):\n y = n * 2\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":22796,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:23:06","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i != 0 and j < len(a) and j != i:\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":10271,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 13:23:22","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":16990,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2017-11-28 13:23:22","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37257,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-28 13:23:25","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":2251,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-28 13:23:25","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":28994,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:23:29","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":27299,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:23:29","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":2495,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:23:33","func_code":"def area(r):\n return float(pi * r ** 2)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":40391,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:23:33","func_code":"def circumference(r):\n return float(2 * r * pi)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":31558,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:24:02","func_code":"def circumference(r):\n return float(2 * r * pi)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":21727,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:24:02","func_code":"def area(r):\n return float(pi * r ** 2)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":25303,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:24:12","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":17762,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:24:12","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":13298,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:24:26","func_code":"def circumference(r):\n return float(2 * r * 3.141)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":1785,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:24:26","func_code":"def area(r):\n return float(3.141 * r ** 2)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":35690,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:24:28","func_code":"def circumference(r):\n c = 2 * 3.141 * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":27356,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:24:50","func_code":"def circumference(r):\n return 2 * r * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":23037,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:24:50","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":9598,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:24:51","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":38849,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:24:51","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":38216,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:24:54","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":6294,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:24:54","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":28704,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:24:59","func_code":"def area(r):\n r = c \/ 2 * 3.141\n return r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17549,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:24:59","func_code":"def circumference(r):\n c = 2 * 3.141 * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":14278,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2017-11-28 13:26:13","func_code":"def area(r):\n a = pi * r * r\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":14677,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2017-11-28 13:26:13","func_code":"def area(r):\n a = pi * r * r\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36995,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2017-11-28 13:26:13","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":14414,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2017-11-28 13:26:13","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":2263,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:26:20","func_code":"def area(r):\n A = 3.141 * r ** 2\n return A","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":38340,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:26:20","func_code":"def circumference(r):\n c = 2 * 3.141 * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":2076,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:26:26","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":16248,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:26:26","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":10499,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:26:46","func_code":"def area(r):\n A = pi * r ** 2\n return A","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20980,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:26:46","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":34600,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:26:46","func_code":"def area(r):\n A = pi * r ** 2\n return A","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17555,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:26:46","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":19863,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:27:29","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":27633,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:27:30","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":7398,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:27:30","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":15106,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:27:34","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i != 0 and j < len(a) and j != i:\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":13666,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:28:07","func_code":"def swap(a, j, i):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i != 0 and j < len(a) and j != i:\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":6903,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:28:08","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":28944,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:28:08","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":9594,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:28:13","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":9202,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2017-11-28 13:28:13","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":2619,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 13:30:06","func_code":"def selection_sort(a):\n while i < len(a):\n j = i + 1\n i = 0\n p = i\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41387,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 13:30:43","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i + 1\n p = i\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":21954,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 13:30:43","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i + 1\n p = i\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":21420,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:30:46","func_code":"def swap(a, j, i):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a - 1)\n j = 0\n while i != 0 and j < len(a) and j != i:\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":27100,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:31:22","func_code":"def swap(a, j, i):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = len(a) - 1\n j = 0\n while i != 0 and j < len(a) and j != i:\n swap(a, i, j)\n i = i - 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":11177,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:32:15","func_code":"def area(r):\n x = pi * r ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26149,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:32:22","func_code":"def circumference(r):\n return r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":37099,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:32:22","func_code":"def area(r):\n (3.141)(r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":19218,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:32:42","func_code":"def swap(a, i, p):\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":28073,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2017-11-28 13:32:42","func_code":"def swap(a, i, p):\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":38839,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 13:33:14","func_code":"def circumference(r):\n y = 2 * 3.141 * r\n return y","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":36257,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 13:33:14","func_code":"def area(r):\n area = 3.141 * r ** 2\n return area","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":11669,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:33:15","func_code":"def area(r):\n x = pi * 3.141 ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10138,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 13:33:18","func_code":"def double(n):\n return n + n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":36427,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 13:33:18","func_code":"def double(n):\n return n + n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34902,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 13:33:59","func_code":"def area(r):\n area = pi * r ** 2\n return area","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20342,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 13:33:59","func_code":"def area(r):\n area = pi * r ** 2\n return area","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12216,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 13:33:59","func_code":"def circumference(r):\n y = 2 * pi * r\n return y","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":12190,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 13:33:59","func_code":"def circumference(r):\n y = 2 * pi * r\n return y","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":4273,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:34:02","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37043,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 13:34:15","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":22869,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:34:21","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":19208,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:34:21","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":19350,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:34:22","func_code":"def area(r):\n (3.141)(r ** r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":18536,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:34:22","func_code":"def circumference(r):\n return (2)(3.141)(r)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":41084,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:34:27","func_code":"def area(r):\n x = pi * 3.141 ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36149,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 13:34:31","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":10803,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:35:07","func_code":"def area(r):\n x = pi * 3.141 ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":25765,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:35:07","func_code":"def circumference(r):\n y = 2 * 3.141 * r\n return y","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":18339,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:35:18","func_code":"def reverse(a):\n tmp = a[len(a) - 1]\n a[len(a) - 1] = a[i]\n a[i] = tmp","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":299,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:35:22","func_code":"def area(r):\n return int((3.141)(r ** r))","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":33861,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:35:22","func_code":"def circumference(r):\n return int((2)(3.141)(r))","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":24689,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:35:30","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] > a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":6854,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:35:33","func_code":"def area(r):\n x = 3.141 * r ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":563,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:35:33","func_code":"def circumference(r):\n y = 2 * 3.141 * r\n return y","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":16100,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:35:45","func_code":"def reverse(a):\n tmp = a[len(a) - i - 1]\n a[len(a) - i - 1] = a[i]\n a[i] = tmp","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":35145,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:36:12","func_code":"def circumference(r):\n y = 2 * pi * r\n return y","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":1604,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:36:12","func_code":"def area(r):\n x = pi * r ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26328,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:36:12","func_code":"def area(r):\n x = pi * r ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":9030,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 13:36:12","func_code":"def circumference(r):\n y = 2 * pi * r\n return y","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":29870,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:36:31","func_code":"def area(r):\n return int((3.141)(r ** r))","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12341,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:36:31","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":33110,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:36:32","func_code":"def reverse(a, i):\n tmp = a[len(a) - i - 1]\n a[len(a) - i - 1] = a[i]\n a[i] = tmp","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38492,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:36:47","func_code":"def swap(a, i, p):\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":20788,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:36:47","func_code":"def swap(a, i, p):\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":9105,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2017-11-28 13:36:47","func_code":"def swap(a, i, p):\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":38600,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:36:51","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] > a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":17116,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:36:57","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":40810,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 13:36:57","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17592,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:36:57","func_code":"def area(r):\n return 3.141 * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":14074,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2017-11-28 13:37:11","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":26334,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2017-11-28 13:37:11","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":2880,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:37:20","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":35417,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2017-11-28 13:37:20","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":18086,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 13:37:27","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":7930,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 13:37:27","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":33057,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:37:39","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":27890,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:37:39","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":2018,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:37:39","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":7232,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:37:39","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":34256,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 13:39:15","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":38192,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 13:39:15","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17965,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 13:39:15","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":27433,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 13:39:15","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":29908,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 13:40:08","func_code":"def double(x):\n y = x * 2\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":16052,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 13:40:29","func_code":"def double(x):\n y = x * 2\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":19562,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 13:40:29","func_code":"def double(x):\n y = x * 2\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":11953,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 13:42:36","func_code":"def double(n):\n y = 2 * n\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":31232,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 13:42:36","func_code":"def double(n):\n y = 2 * n\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":37110,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:43:01","func_code":"def reverse(a, i):\n tmp = a[len(a) - i - 1]\n a[len(a) - i - 1] = a[i]\n a[i] = tmp","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":4668,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:43:50","func_code":"def selection_sort(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":22766,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:44:38","func_code":"def selection_sort(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":13576,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:45:08","func_code":"def selection_sort(a):\n i = 0\n p = 1\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":3068,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:45:09","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":14844,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:45:09","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":30429,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:45:24","func_code":"def selection_sort(a):\n i = 0\n p = 1\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41502,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:46:15","func_code":"def area(n):\n return 3.141 * n ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":38568,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:46:15","func_code":"def circumference(n):\n return 2 * 3.141 * n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":27077,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 13:46:33","func_code":"def selection_sort(a):\n i = p\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41582,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 13:46:35","func_code":"def area(r):\n a = 3.141 * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":25728,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:46:53","func_code":"def circumference(n):\n return 2 * pi * n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":13919,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:46:53","func_code":"def circumference(n):\n return 2 * pi * n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":38978,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:46:53","func_code":"def area(n):\n return pi * n ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":24548,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:46:53","func_code":"def area(n):\n return pi * n ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":1568,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:46:58","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":37178,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:46:58","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34342,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:47:02","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/\/ 2:\n swap(a, i, len(a) - 1 - i)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":29421,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:47:02","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/\/ 2:\n swap(a, i, len(a) - 1 - i)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":12219,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:47:07","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i\n smallest = j\n while j < len(a):\n if a[j] < a[smallest]:\n smallest = j\n j = j + 1\n a[i], a[smallest] = a[smallest], a[i]\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":13817,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2017-11-28 13:47:07","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i\n smallest = j\n while j < len(a):\n if a[j] < a[smallest]:\n smallest = j\n j = j + 1\n a[i], a[smallest] = a[smallest], a[i]\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":28892,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 13:48:11","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":37452,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 13:48:33","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":24423,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 13:48:33","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":24755,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 13:48:33","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":2557,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 13:48:33","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":3131,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2017-11-28 13:49:24","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = i\n tmp = a[p]\n a[p] = a[j]\n a[j] = tmp\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":20705,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2017-11-28 13:49:24","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = i\n tmp = a[p]\n a[p] = a[j]\n a[j] = tmp\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":14344,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2017-11-28 13:50:27","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":8055,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2017-11-28 13:50:27","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":23318,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:51:02","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":37625,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2017-11-28 13:51:02","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":6345,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:51:09","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = i\n tmp = a[p]\n a[p] = a[j]\n a[j] = tmp\n j += 1\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":17111,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:51:16","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = i\n tmp = a[p]\n a[p] = a[j]\n a[j] = tmp\n j += 1\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":17515,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2017-11-28 13:51:16","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = i\n tmp = a[p]\n a[p] = a[j]\n a[j] = tmp\n j += 1\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41496,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 13:51:17","func_code":"def reverse(a):\n i = 0\n j = len(a)\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12587,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 13:51:57","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":24723,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 13:51:57","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":2306,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 13:52:01","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":27843,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 13:52:01","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20101,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 13:53:14","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":1900,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 13:53:14","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":5262,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 13:53:52","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":17395,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 13:53:52","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":18081,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2017-11-28 13:54:02","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":39770,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2017-11-28 13:54:02","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":15628,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2017-11-28 13:54:02","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":8286,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2017-11-28 13:54:02","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":39387,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 13:54:20","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":28306,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 13:54:20","func_code":"def circumference(r):\n y = pi * 2 * r\n return y","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":23456,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 13:54:20","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10360,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 13:54:20","func_code":"def circumference(r):\n y = pi * 2 * r\n return y","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":32481,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:54:39","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1 - j\n while j < len(a):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":7292,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 13:54:46","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":7152,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 13:54:46","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":15181,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:56:02","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while j < len(a):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37937,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 13:56:26","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":7036,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 13:56:26","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":20909,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 13:56:57","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":1763,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 13:57:15","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":28259,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 13:57:15","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":924,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 13:58:24","func_code":"def double(x):\n x = x * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":5779,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 13:58:24","func_code":"def double(x):\n x = x * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":7279,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 13:58:54","func_code":"def circumference(r):\n return float(2 * 3.141 * r)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":29243,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 13:58:54","func_code":"def area(r):\n return float(3.141 * r ** 2)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":10951,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 13:59:00","func_code":"def circumference(r):\n return r * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":4981,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 13:59:00","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":18201,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 13:59:29","func_code":"def circumference(r):\n return 2 * r * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":30863,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 13:59:29","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":15789,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 13:59:48","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while j < len(a) and len(a) > 0:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":16475,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 13:59:56","func_code":"def circumference(r):\n return 2 * r * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":26710,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 13:59:56","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":6363,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 14:00:02","func_code":"def circumference(r):\n return float(2 * pi * r)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":26619,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 14:00:02","func_code":"def area(r):\n return float(pi * r ** 2)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":37186,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 14:00:02","func_code":"def circumference(r):\n return float(2 * pi * r)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":23873,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 14:00:02","func_code":"def area(r):\n return float(pi * r ** 2)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":6529,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:00:03","func_code":"def circumference(r):\n return 2 * r * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":21132,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:00:03","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":33404,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 14:00:21","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26904,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 14:00:21","func_code":"def circumference(r):\n return 2 * r * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":38,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 14:00:21","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35065,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 14:00:21","func_code":"def circumference(r):\n return 2 * r * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":7077,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 14:00:24","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while j < len(a) and len(a) > 1:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2017-11-28 14:01:09","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":5061,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2017-11-28 14:01:09","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37938,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 14:01:18","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":13859,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 14:01:18","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":36421,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:01:37","func_code":"def double(n):\n x = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":31197,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:01:43","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":39589,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:01:43","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":41237,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:02:02","func_code":"def swap(a, i, j):\n while j < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n j = j + 1\n i = i - 1\n return a\n\n\ndef reverse(a):\n j = 0\n i = len(a) - 1\n print(swap(a, i, j))","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":23772,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:02:03","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":28609,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:02:03","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25579,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 14:02:09","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":2058,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 14:02:09","func_code":"def area(r):\n return r * r * pi","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":1084,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 14:02:09","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":20252,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 14:02:09","func_code":"def area(r):\n return r * r * pi","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26517,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:02:31","func_code":"def swap(a, i, j):\n while j < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n j = j + 1\n i = i + 1\n return a\n\n\ndef reverse(a):\n j = 0\n i = len(a) - 1\n print(swap(a, i, j))","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30774,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 14:02:50","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while j < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20795,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:03:06","func_code":"def reverse(a):\n j = 0\n i = len(a) - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":33393,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:03:10","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":27,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:03:10","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":2938,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:03:14","func_code":"def double(n):\n return n * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":38330,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 14:03:57","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":2943,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2017-11-28 14:03:57","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":27402,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 14:04:07","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":6771,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 14:04:07","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":6891,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:04:12","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20476,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:04:12","func_code":"def circumference(r):\n return 2 * r * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":19488,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:04:12","func_code":"def circumference(r):\n return 2 * r * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":7438,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:04:12","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26073,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:04:24","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34064,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:04:24","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":3996,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 14:04:26","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":20925,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 14:04:26","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":559,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:04:31","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":7864,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2017-11-28 14:04:35","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":32590,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2017-11-28 14:04:35","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25848,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:04:43","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":41526,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:04:43","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":29058,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:05:00","func_code":"def reverse(a):\n tmp = a[len(a) - i - 1]\n a[len(a) - i - 1] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39132,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 14:05:06","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[j] = a[i]\n a[i] = tmp\n i = i - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":21820,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:05:07","func_code":"def circumference(x):\n x = 2 * x * 3.141\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":1553,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:05:07","func_code":"def area(x):\n x = x * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":9941,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:05:15","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":12328,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:05:15","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":39729,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:05:23","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":26178,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:05:23","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":42456,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:05:24","func_code":"def area(r):\n 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35490,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:05:24","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":36402,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:05:25","func_code":"def circumference(r):\n x = pi * r * 2\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":27466,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:05:25","func_code":"def circumference(x):\n x = 2 * x * 3.141\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":25673,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:05:25","func_code":"def area(r):\n x = pi * r * r\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":16713,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:05:25","func_code":"def circumference(r):\n x = pi * r * 2\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":25671,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:05:25","func_code":"def area(x):\n x = x * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4159,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:05:25","func_code":"def area(r):\n x = pi * r * r\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":37928,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 14:05:32","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[j] = a[i]\n a[i] = tmp\n j = j + 1\n i = i - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":3022,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:05:38","func_code":"def double(n):\n n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":35541,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:05:48","func_code":"def area(x):\n x = 3.141 * x ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":27105,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:05:48","func_code":"def circumference(x):\n x = 2 * x * 3.141\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":520,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:05:54","func_code":"def double(n):\n n = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":37218,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:05:54","func_code":"def double(n):\n n = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":8119,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 14:06:01","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":34336,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:06:17","func_code":"def area(r):\n 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10905,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:06:17","func_code":"def circumference(r):\n return 6.282 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":35181,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:06:32","func_code":"def double(n):\n n = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":11999,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:06:32","func_code":"def double(n):\n n = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":40884,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:06:44","func_code":"def double(n):\n n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":1893,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:06:51","func_code":"def circumference(r):\n m = 2 * 3.141 * r\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":2330,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:06:51","func_code":"def area(r):\n m = 3.141 * r ** 2\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":21893,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 14:06:52","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":26801,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 14:06:52","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":16009,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:06:54","func_code":"def circumference(r):\n return 6.282 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":9821,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:06:54","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":42095,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:06:54","func_code":"def circumference(r):\n return 6.282 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":289,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:06:54","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":8968,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:06:57","func_code":"def reverse(a):\n tmp = a[len(a) - 1]\n a[len(a) - 1] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":33490,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:07:17","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":32423,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:07:17","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":2184,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:07:26","func_code":"def circumference(r):\n m = 2 * pi * r\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":39345,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:07:26","func_code":"def circumference(r):\n m = 2 * pi * r\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":6430,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:07:26","func_code":"def area(r):\n m = pi * r ** 2\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":38405,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:07:26","func_code":"def area(r):\n m = pi * r ** 2\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":25187,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:07:31","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25653,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:07:31","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":5271,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:07:34","func_code":"def area(r):\n return r * r * 3.141","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":25825,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:07:34","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":20419,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:07:37","func_code":"def reverse(a):\n j = 0\n i = len(a) - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":25944,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:07:39","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":25024,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:07:50","func_code":"def double(x):\n y = 2 * x\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":30137,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:07:50","func_code":"def double(x):\n y = 2 * x\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":30502,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:07:56","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":41088,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:07:56","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":31510,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:08:00","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":3146,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:08:00","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25200,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 14:08:02","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n j = len(a) - i - 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":29092,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:08:08","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34688,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:08:08","func_code":"def double(n):\n x = n * 2\n return x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25805,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:08:12","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":22296,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 14:08:12","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":41146,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 14:08:12","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":14927,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:08:12","func_code":"def area(r):\n return r * r * pi","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":6244,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:08:12","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":3707,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 14:08:12","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17476,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2017-11-28 14:08:12","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":10320,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:08:12","func_code":"def area(r):\n return r * r * pi","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20414,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 14:08:16","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n j = len(a) - i - 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39989,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 14:08:34","func_code":"def reverse(a):\n x = a[::-1]\n return x","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":20173,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 14:08:39","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n j = len(a) - i - 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":23446,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:08:40","func_code":"def reverse(a):\n j = 0\n i = len(a) - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":15899,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 14:08:46","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[i]\n a[j] = a[i]\n a[i] = tmp\n j = j - 1\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":21422,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2017-11-28 14:08:55","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":30887,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:09:07","func_code":"def double(n):\n m = 2 * n\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":13263,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:09:09","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":40726,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:09:09","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":12159,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:09:18","func_code":"def reverse(a):\n j = 0\n i = len(a) - 1\n return j","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":22636,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 14:09:20","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":3885,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 14:09:20","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":2344,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 14:09:20","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":23274,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 14:09:20","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":16529,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:09:28","func_code":"def circumference(x):\n x = 2 * x * 3.141\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":7210,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:09:28","func_code":"def area(x):\n x = 3.141 * x ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36760,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:09:32","func_code":"def reverse(a):\n j = 0\n i = len(a) - 1\n return j, i","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":5906,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 14:09:33","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[j]\n a[i] = tmp\n j = j - 1\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":18272,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:09:33","func_code":"def double(n):\n m = 2 * n\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":20080,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:09:33","func_code":"def double(n):\n m = 2 * n\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25201,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:09:35","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":3409,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:09:35","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":8642,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:09:40","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":21707,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 14:09:50","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n j = j - 1\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":18035,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2017-11-28 14:09:57","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":15101,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2017-11-28 14:09:57","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":29422,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2017-11-28 14:09:57","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":34820,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2017-11-28 14:09:57","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":106,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:09:58","func_code":"def area(r):\n return 2 * 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":34541,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:09:58","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":34827,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2017-11-28 14:09:59","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":10745,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2017-11-28 14:09:59","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":33349,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2017-11-28 14:09:59","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":16468,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2017-11-28 14:09:59","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40493,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:10:07","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":22951,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2017-11-28 14:10:08","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25281,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2017-11-28 14:10:08","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25093,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:10:12","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":41785,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:10:13","func_code":"def area(x):\n x = 3.141 * x ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":22855,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:10:13","func_code":"def circumference(x):\n x = 2 * x * 3.141\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":9083,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:10:14","func_code":"def area(r):\n r = r * r\n return r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":953,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:10:14","func_code":"def circumference(r):\n r = r * 2 * 3.141\n return r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":2816,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 14:10:23","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":14311,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2017-11-28 14:10:24","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34080,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2017-11-28 14:10:24","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":7285,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 14:10:27","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n\n\ndef smallest(a, i):\n minimum = i\n while i < len(a):\n if a[i] < a[minimum]:\n minimum = i\n i = i + 1\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n pos = smallest(a, i)\n swap(a, i, pos)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":10658,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:10:32","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":29875,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:10:32","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":13656,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:10:44","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":4160,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:10:44","func_code":"def area(r):\n return 2 * pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":29183,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:10:45","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":33158,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 14:10:48","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36683,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 14:10:48","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":5202,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 14:10:48","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33610,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 14:10:48","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":7793,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 14:10:53","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n\n\ndef smallest(a, i):\n minimum = i\n while i < len(a):\n if a[i] < a[minimum]:\n minimum = i\n i = i + 1\n return minimum\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n pos = smallest(a, i)\n swap(a, i, pos)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34801,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2017-11-28 14:10:53","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n\n\ndef smallest(a, i):\n minimum = i\n while i < len(a):\n if a[i] < a[minimum]:\n minimum = i\n i = i + 1\n return minimum\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n pos = smallest(a, i)\n swap(a, i, pos)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":11965,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:10:54","func_code":"def double(n):\n m = 2 * n\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":36112,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:10:54","func_code":"def double(n):\n m = 2 * n\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":4487,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:11:01","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":12082,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:11:01","func_code":"def reverse(a):\n j = 0\n i = len(a) - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":10685,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:11:01","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34280,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 14:11:04","func_code":"def reverse(a):\n return a[len(a) - 1:]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13736,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:11:07","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":39299,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:11:07","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":9558,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:11:07","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":29572,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:11:07","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":9152,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2017-11-28 14:11:08","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":6126,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2017-11-28 14:11:08","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":22949,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:11:09","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33218,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:11:09","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":40514,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:11:09","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":22263,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:11:09","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26906,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 14:11:13","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":6981,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 14:11:13","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":32342,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:11:21","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":8958,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:11:21","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":16861,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:11:21","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":26773,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:11:21","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":32619,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:11:21","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":18513,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 14:11:22","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n j = j - 1\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":3919,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 14:11:31","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":6895,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 14:11:31","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":8676,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:11:36","func_code":"def area(x):\n x = pi * x ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":13025,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:11:36","func_code":"def circumference(x):\n x = 2 * x * pi\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":34185,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:11:36","func_code":"def area(x):\n x = pi * x ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":40739,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:11:36","func_code":"def circumference(x):\n x = 2 * x * pi\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":40353,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:11:39","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":24060,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 14:11:50","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n j = j - 1\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":19652,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 14:11:50","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n j = j - 1\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37096,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:11:54","func_code":"def area(r):\n return 3 * 3.141 * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":22751,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 14:11:54","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":23393,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:11:54","func_code":"def circumference(r):\n return r * 2 * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":4012,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:11:54","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while j > len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13539,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:12:08","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n while i < len(a):\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":28827,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:12:11","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17723,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:12:11","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":33008,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:12:24","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":25226,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:12:24","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":8027,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:12:24","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":32167,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:12:24","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":36593,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 14:12:38","func_code":"def area(r):\n t = 3.141 * r ** 2\n return t","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":29268,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 14:12:38","func_code":"def circumference(r):\n s = 2 * 3.141 * r\n return s","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":1687,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:12:40","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":2459,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:12:40","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25087,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 14:12:41","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":23867,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:12:43","func_code":"def area(r):\n return r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":37536,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:12:43","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":23721,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:12:45","func_code":"def swap(a, i, j):\n temp = a[i]\n a[i] = a[j]\n a[j] = a[i]\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < j:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20181,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:12:54","func_code":"def area(r):\n ar = pi * r ** 2\n return ar","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4702,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:12:57","func_code":"def area(r):\n r = r ** 2 * 3.141\n return r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":17512,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:12:57","func_code":"def circumference(r):\n r = r * 2 * 3.141\n return r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":31224,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:13:00","func_code":"def double(n):\n m = n * n\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":35196,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:13:05","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while j > len(a) \/ 2:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13993,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 14:13:16","func_code":"def area(r):\n t = pi * r ** 2\n return t","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":7202,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 14:13:16","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n a[i] = a[i - 1]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":4995,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 14:13:16","func_code":"def area(r):\n t = pi * r ** 2\n return t","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":41876,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 14:13:16","func_code":"def circumference(r):\n s = 2 * pi * r\n return s","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":35128,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 14:13:16","func_code":"def circumference(r):\n s = 2 * pi * r\n return s","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":9563,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:13:19","func_code":"def circumference(r):\n x = 2 * 3.141 * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":32467,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:13:19","func_code":"def area(r):\n y = 3.141 * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":26780,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:13:22","func_code":"def area(r):\n return 3 * pi * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":30257,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:13:22","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":59,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:13:28","func_code":"def area(r):\n x = pi + r ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36886,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:13:28","func_code":"def circumference(r):\n x = 2 * pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":35846,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:13:29","func_code":"def circumference(r):\n cir = 2 * pi * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":6034,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:13:29","func_code":"def circumference(r):\n cir = 2 * pi * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":36920,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:13:29","func_code":"def area(r):\n ar = pi * r ** 2\n return ar","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":3185,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:13:29","func_code":"def area(r):\n ar = pi * r ** 2\n return ar","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":30324,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:13:33","func_code":"def double(n):\n m = n * 2\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":7177,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:13:36","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":10785,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:13:36","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":6128,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:13:46","func_code":"def area(r):\n x = pi * r ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":30315,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:14:08","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":9727,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:14:08","func_code":"def circumference(r):\n x = 2 * pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":38833,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:14:08","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":851,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:14:08","func_code":"def circumference(r):\n x = 2 * pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":17586,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 14:14:09","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":2961,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 14:14:09","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":28682,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 14:14:13","func_code":"def double(x):\n y = x * 2\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":42226,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:14:14","func_code":"def reverse(a):\n i = 0\n return a[len(a) - i]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":42011,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:14:15","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":21772,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:14:24","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":26333,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:14:24","func_code":"def area(r):\n return 3.14 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":28129,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:14:32","func_code":"def area(n):\n m = 3.14 * 3 ** 2\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":39992,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:14:32","func_code":"def circumference(n):\n m = 2 * 3.14 * n\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":32992,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:14:34","func_code":"def swap(a, i, j):\n temp = a[i]\n a[i] = a[j]\n a[j] = temp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < j:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36169,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:14:34","func_code":"def swap(a, i, j):\n temp = a[i]\n a[i] = a[j]\n a[j] = temp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < j:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":26,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:14:37","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":1288,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:14:37","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34135,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:14:40","func_code":"def circumference(r):\n x = 2 * pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":13232,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:14:40","func_code":"def area(r):\n y = pi + r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":2892,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:14:43","func_code":"def circumference(r):\n x = 2 * 3.141 * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":42451,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:14:43","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":31556,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:14:45","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":9191,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:14:45","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36665,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:14:45","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":6789,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:14:45","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":8390,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:14:53","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":42418,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:14:53","func_code":"def area(r):\n return 3.14 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":2498,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2017-11-28 14:14:59","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17724,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:14:59","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":27204,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:14:59","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":11720,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2017-11-28 14:14:59","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":36268,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:15:00","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while j > len(a) \/ 2:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":26024,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:15:00","func_code":"def circumference(r):\n x = 2 * pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":11861,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:15:00","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":25045,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:15:00","func_code":"def circumference(r):\n x = 2 * pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":38517,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:15:00","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":133,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:15:05","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34635,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 14:15:07","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":9914,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 14:15:07","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":30263,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:15:08","func_code":"def circumference(r):\n x = 2 * pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":457,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:15:08","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":6061,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:15:08","func_code":"def reverse(a):\n i = 0\n return a[len(a) - i - 1]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11381,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:15:15","func_code":"def circumference(r):\n x = 2 * pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":37037,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:15:15","func_code":"def circumference(r):\n x = 2 * pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":3111,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:15:15","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":11569,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:15:15","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":21489,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:15:17","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a)\n while i < len(a):\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":19980,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 14:15:23","func_code":"def double(x):\n y = x * 2\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":38368,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 14:15:23","func_code":"def double(x):\n y = x * 2\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":1842,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:15:29","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":25901,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:15:29","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":31607,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:15:30","func_code":"def circumference(n):\n m = 2 * 3.14 * n\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33881,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:15:30","func_code":"def area(n):\n m = 3.14 * n ** 2\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17833,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:15:32","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n return a[len(a) - i - 1]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":1999,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:15:34","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17959,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:15:34","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":18393,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:15:34","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while j > len(a) \/ 2:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14839,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:15:34","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":20956,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:15:34","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":294,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:15:58","func_code":"def area(n):\n x = 3.141 * n ** 2\n return area","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":2173,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:15:58","func_code":"def circumference(n):\n m = 3.141 * n * 2\n return circumference","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":10576,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:16:03","func_code":"def circumference(r):\n return 2 * r * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":17058,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:16:03","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":34520,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:16:08","func_code":"def area(r):\n r = r ** 2 * pi\n return r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":19772,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:16:08","func_code":"def area(r):\n r = r ** 2 * pi\n return r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":32791,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:16:08","func_code":"def circumference(r):\n r = r * 2 * pi\n return r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33892,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:16:08","func_code":"def circumference(r):\n r = r * 2 * pi\n return r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":5027,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:16:11","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":683,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:16:11","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":7844,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:16:11","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":14499,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:16:11","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":38759,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 14:16:22","func_code":"def reverse(a):\n x = a[:]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8934,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:16:23","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) + 1\n while i < len(a):\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":32373,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 14:16:28","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":22173,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 14:16:28","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":25681,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 14:16:38","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":25900,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 14:16:38","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":34414,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:16:49","func_code":"def double(n):\n m = 2 * n\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":40188,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:16:49","func_code":"def double(n):\n m = 2 * n\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":3878,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:16:53","func_code":"def circumference(r):\n return 2 * r * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":40389,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:16:53","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":2402,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:16:53","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":1173,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:16:53","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":4719,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:16:53","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17964,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:16:53","func_code":"def circumference(r):\n return 2 * r * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":29251,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:16:57","func_code":"def circumference(r):\n return r * 3.141 * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":40117,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:16:57","func_code":"def area(r):\n return r * r * 3.141","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":2701,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:17:07","func_code":"def area(t):\n x = 3.141 * t ** 2\n return area","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":28168,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:17:07","func_code":"def circumference(n):\n m = 3.141 * n * 2\n return circumference","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":29741,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:17:10","func_code":"def circumference(r):\n n = 2 * 3.141 * r\n return n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":30364,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:17:10","func_code":"def area(r):\n m = 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":1208,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2017-11-28 14:17:15","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":8350,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2017-11-28 14:17:15","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":40249,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2017-11-28 14:17:15","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":37786,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2017-11-28 14:17:15","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":7687,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 14:17:16","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":6866,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2017-11-28 14:17:19","func_code":"def double(x):\n y = 2 * x\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":10615,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2017-11-28 14:17:19","func_code":"def double(x):\n y = 2 * x\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":15107,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:17:23","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37199,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:17:33","func_code":"def area(r):\n m = 3.141 * r ** 2\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":3640,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:17:33","func_code":"def circumference(r):\n n = 2 * 3.141 * r\n return n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":15120,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 14:17:42","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":11959,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:17:47","func_code":"def area(n):\n m = 3.141 * n ** 2\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":22076,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:17:47","func_code":"def circumference(n):\n m = 2 * 3.141 * n\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":1754,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:17:50","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":3710,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 14:17:56","func_code":"def double(x):\n m = x * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":35576,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2017-11-28 14:17:57","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":41077,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2017-11-28 14:17:57","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":32603,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2017-11-28 14:17:57","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":9572,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2017-11-28 14:17:57","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":8367,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:18:03","func_code":"def circumference(r):\n return r * pi * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":8268,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:18:03","func_code":"def circumference(r):\n return r * pi * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":24220,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:18:03","func_code":"def area(r):\n return r * r * pi","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":25242,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:18:03","func_code":"def area(r):\n return r * r * pi","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10924,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 14:18:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":40427,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2017-11-28 14:18:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":9174,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:18:11","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n a[len(a) - i - 1]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8002,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 14:18:14","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":458,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 14:18:14","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":24880,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:18:16","func_code":"def area(r):\n m = pi * r ** 2\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":28815,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:18:16","func_code":"def area(r):\n m = pi * r ** 2\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12498,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:18:16","func_code":"def circumference(r):\n n = 2 * pi * r\n return n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":34433,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:18:16","func_code":"def circumference(r):\n n = 2 * pi * r\n return n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":13145,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:18:17","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while j > len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":25906,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:18:23","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":29246,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2017-11-28 14:18:25","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":24059,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2017-11-28 14:18:25","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12834,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2017-11-28 14:18:25","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":34892,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2017-11-28 14:18:25","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":29670,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:18:26","func_code":"def circumference(n):\n m = 2 * pi * n\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":26756,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:18:26","func_code":"def area(n):\n m = pi * n ** 2\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":29288,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:18:26","func_code":"def circumference(n):\n m = 2 * pi * n\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":17607,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:18:26","func_code":"def area(n):\n m = pi * n ** 2\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4854,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:18:32","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":31941,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:18:32","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":6165,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 14:18:43","func_code":"def double(n):\n n = 2 * n\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":14188,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 14:18:43","func_code":"def double(n):\n n = 2 * n\n return n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":32245,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:18:51","func_code":"def double(n):\n print(n * 2)","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":26829,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:18:52","func_code":"def area(n):\n x = 3.141 * n ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":21573,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:18:52","func_code":"def circumference(n):\n m = 3.141 * n * 2\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":21669,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:18:55","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":24058,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:18:55","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":21099,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:18:58","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":8278,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:18:58","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":25857,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:19:12","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20456,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:19:28","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":34673,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:19:28","func_code":"def area(t):\n x = 3.141 * t ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":19593,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:19:28","func_code":"def circumference(n):\n m = 3.141 * n * 2\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":14727,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2017-11-28 14:19:37","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = a[len(a) - i - 1]\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":24889,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:19:37","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[i]\n a[i] = a[len(a) - 1 - i]\n a[len(a) - 1 - i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13502,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:19:38","func_code":"def circumference(r):\n pi = 3.141\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":30255,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:19:38","func_code":"def area(r):\n pi = 3.141\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":22145,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 14:19:47","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":31161,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 14:19:47","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":32984,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 14:19:48","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":24714,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 14:19:48","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":13119,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:20:00","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":41194,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:20:06","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":19510,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 14:20:06","func_code":"def selection_sort(a):\n i = 0","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":29664,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:20:06","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":42059,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:20:06","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":2214,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:20:06","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":41843,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:20:16","func_code":"def area(r):\n return 3.141 * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":14250,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:20:17","func_code":"def area(r):\n a = r ** 2 * 3.141\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":10860,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:20:17","func_code":"def circumference(r):\n c = r * 3.141 * 2\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":33867,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 14:20:34","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":32128,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:20:34","func_code":"def area(r):\n return r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12868,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 14:20:34","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":10617,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 14:20:34","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":40835,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:20:34","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":1221,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 14:20:34","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10250,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:20:40","func_code":"def area(a):\n a = l * w\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12707,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:20:40","func_code":"def circumference():\n pi = 3.14\n cir = 2 * pi * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":20782,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:20:42","func_code":"def swap(a, i, j):\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = i + 1\n j = j - 1\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n swap(a, i, j)","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":1381,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:20:44","func_code":"def area(t):\n x = pi * t ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12067,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:20:44","func_code":"def circumference(n):\n m = pi * n * 2\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":13587,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:20:44","func_code":"def circumference(n):\n m = pi * n * 2\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":21478,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 14:20:44","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i + 1\n p = i\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":28373,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:20:44","func_code":"def area(t):\n x = pi * t ** 2\n return x","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":11261,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2017-11-28 14:20:44","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i + 1\n p = i\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":5879,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:20:48","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":16842,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:20:48","func_code":"def area(r):\n return 3.141 * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4008,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:20:50","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - 1 - i]\n a[len(a) - 1 - i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":7829,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:20:50","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - 1 - i]\n a[len(a) - 1 - i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":27165,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 14:21:00","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":26991,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 14:21:00","func_code":"def area():\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":32598,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:21:04","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":42078,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:21:04","func_code":"def area(r):\n a = pi * r * 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":32847,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:21:08","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":21697,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:21:08","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":16720,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:21:09","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n print(a[len(a) - i - 1])\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":2652,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:21:11","func_code":"def circumference(r):\n c = r * pi * 2\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":28531,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:21:11","func_code":"def area(r):\n a = r ** 2 * pi\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":7970,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:21:11","func_code":"def circumference(r):\n c = r * pi * 2\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":18785,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:21:11","func_code":"def area(r):\n a = r ** 2 * pi\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17785,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:21:13","func_code":"def area(r):\n return r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":24614,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:21:13","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":12260,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2017-11-28 14:21:14","func_code":"def double(x):\n return 2 * x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":581,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2017-11-28 14:21:14","func_code":"def double(x):\n return 2 * x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":27913,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2017-11-28 14:21:14","func_code":"def double(x):\n return 2 * x","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":10105,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:21:17","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":13444,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:21:17","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":16763,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:21:30","func_code":"def area(r):\n a = pi * r * 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":31471,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:21:30","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":24938,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:21:30","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":6761,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:21:30","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":22646,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:21:37","func_code":"def circumference(cir):\n cir = 2 * pi * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":27591,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:21:37","func_code":"def area(a):\n a = l * w\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":39300,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 14:21:54","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":16656,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2017-11-28 14:21:54","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":21011,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:22:04","func_code":"def selection_sort(a):\n i = 0\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":37325,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:22:08","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":6612,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:22:08","func_code":"def area(r):\n a = pi * r * 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":14993,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 14:22:10","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30152,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 14:22:10","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":18612,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:22:10","func_code":"def selection_sort(a):\n p = 0\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if int(a[j]) < int(a[p]):\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":13638,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 14:22:18","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":18942,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2017-11-28 14:22:18","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":14673,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 14:22:20","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":26823,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 14:22:20","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":17250,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 14:22:20","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":32570,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 14:22:20","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26323,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 14:22:26","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":25670,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 14:22:26","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":22072,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:22:27","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":38834,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:22:27","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":28958,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:22:31","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":15205,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:22:40","func_code":"def reverse(a):\n len(a) - i - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38944,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:22:43","func_code":"def area(r):\n a = 3.141 * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":2903,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:22:43","func_code":"def circumference(r):\n c = 2 * 3.141 * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":41291,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 14:22:46","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":37229,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 14:22:46","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":36255,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 14:22:50","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":34796,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 14:22:50","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":22253,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 14:22:50","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":15977,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 14:22:50","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":31855,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:22:54","func_code":"def circumference(cir):\n r = input()\n cir = 2 * pi * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":12562,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:22:54","func_code":"def area(a):\n a = l * w\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":5036,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:23:02","func_code":"def reverse(a):\n m = len(a) - i - 1\n return m","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":3800,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 14:23:02","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":2592,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2017-11-28 14:23:02","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":2061,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:23:13","func_code":"def area(a):\n a = l * w\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":25721,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:23:13","func_code":"def circumference(cir):\n r = 0\n cir = 2 * pi * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":6265,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:23:20","func_code":"def reverse(a):\n a[len(a) - i - 1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":41303,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:23:23","func_code":"def reverse(a):\n m = len(a) - i - 1\n return m\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":4584,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:23:29","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n print(a[len(a) - i - 1])\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8841,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:23:29","func_code":"def reverse(a, i):\n while i < len(a):\n return a[len(a) - i - 1]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38058,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:23:37","func_code":"def area(a):\n l = 0\n w = 0\n a = l * w\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26225,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:23:37","func_code":"def circumference(cir):\n r = 0\n cir = 2 * pi * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":35691,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 14:23:44","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":15322,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2017-11-28 14:23:44","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":33069,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:23:45","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":9758,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:23:45","func_code":"def area(r):\n return (pi * r) ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":24262,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:23:46","func_code":"def reverse(a):\n m = len(a) - i - 1\n return m\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37793,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:23:47","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":41972,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:23:47","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":1241,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:23:47","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":1679,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:23:47","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4049,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:23:54","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if int(a[j]) < int(a[p]):\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":25001,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:23:55","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":25500,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:23:55","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":19810,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:23:59","func_code":"def selection_sort(a):\n p = 0\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":28597,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:24:08","func_code":"def reverse(a):\n m = len(a) - i - 1\n return m","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":35516,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:24:10","func_code":"def reverse(a):\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1]\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":15971,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:24:13","func_code":"def circumference(cir):\n r = 0\n cir = 2 * pi * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":14562,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:24:13","func_code":"def area(l, w):\n a = l * w\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26975,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:24:17","func_code":"def selection_sort(a):\n p = 0\n j = p + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":15529,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:24:23","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef selection_sort(a):\n i = 0\n j = len(a) - 1\n while i < len(a):\n swap(a, i, j)\n i = i + 1\n j = j + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":30944,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:24:24","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":34829,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:24:24","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17983,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:24:24","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":37171,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:24:24","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":5498,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:24:26","func_code":"def reverse(a):\n m = len(a) - i - 1\n return m","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":29922,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:24:31","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":10908,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2017-11-28 14:24:31","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":19178,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:24:41","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":2654,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:24:41","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":113,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:24:41","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":16588,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:24:41","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":39848,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 14:24:44","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":32631,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:24:51","func_code":"def selection_sort(a):\n i = 1\n while i < len(a):\n smallest = i\n j = i + 1\n while j < len(a):\n if a[i] < a[smallest]:\n smallest = i\n j = j + 1\n temp = a[i]\n a[i] = a[j]\n a[j] = temp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":23627,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:24:59","func_code":"def reverse(a):\n while i < len(a):\n return a[len(a) - i - 1]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":2771,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2017-11-28 14:25:04","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":7520,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:25:09","func_code":"def circumference(r):\n return r * 2 * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":30922,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:25:09","func_code":"def area(r):\n return (3.141 * r) ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":38181,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:25:13","func_code":"def selection_sort(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":9570,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:25:18","func_code":"def area(r):\n a = 3.141 * pi ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20022,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:25:18","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":10328,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2017-11-28 14:25:30","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":32239,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2017-11-28 14:25:30","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":30878,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2017-11-28 14:25:30","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":40000,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2017-11-28 14:25:30","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":20126,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 14:25:31","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":35002,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2017-11-28 14:25:31","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":31092,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:25:36","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n return a[len(a) - i - 1]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":41027,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:25:40","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":8413,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:25:40","func_code":"def circumference(r):\n r = 0\n r = 2 * pi * r\n return cir","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":37062,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:25:40","func_code":"def area(r):\n l = 0\n w = 0\n r = l * w\n return r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":22230,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:25:40","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":40170,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2017-11-28 14:25:43","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30427,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2017-11-28 14:25:43","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":16661,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 14:25:50","func_code":"def double(x):\n m = x * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":36789,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2017-11-28 14:25:50","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":750,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2017-11-28 14:25:50","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":37251,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 14:25:50","func_code":"def double(x):\n m = x * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":13306,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 14:25:57","func_code":"def circumference(r):\n m = 2 * 3.141 * r\n return m","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":12629,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 14:25:57","func_code":"def area(r):\n m = 3.141 * r * r\n return m","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":7298,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:25:57","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1]\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":2288,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:26:02","func_code":"def reverse(a, i):\n i = 0\n while i < len(a):\n return a[len(a) - i - 1]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12231,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:26:03","func_code":"def circumference(r):\n r = 0\n r = 2 * pi * r\n return r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":15375,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:26:03","func_code":"def area(r):\n l = 0\n w = 0\n r = l * w\n return r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":11196,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:26:08","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40168,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:26:12","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":30653,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:26:12","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":17361,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:26:12","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":23808,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:26:12","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":23931,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:26:13","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n return a[len(a) - i - 1]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":28400,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:26:14","func_code":"def circumference(r):\n c = 2 * pi * r\n pi = 3.141\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":3717,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:26:14","func_code":"def area(r):\n a = 3.141 * pi ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":3517,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:26:23","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":6185,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:26:26","func_code":"def circumference(r):\n return r * 2 * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":39858,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:26:26","func_code":"def area(r):\n return r ** 2 * 3.141","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":3474,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:26:52","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":2682,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:26:52","func_code":"def area(r):\n return r ** 2 * pi","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12399,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:26:52","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":32542,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 14:26:52","func_code":"def area(r):\n return r ** 2 * pi","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":29256,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 14:26:53","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":23146,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 14:26:53","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":36466,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:26:54","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n smallest = i\n j = i + 1\n while j < len(a):\n if a[j] < a[smallest]:\n smallest = j\n j = j + 1\n temp = a[smallest]\n a[smallest] = a[i]\n a[i] = temp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34597,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2017-11-28 14:26:54","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n smallest = i\n j = i + 1\n while j < len(a):\n if a[j] < a[smallest]:\n smallest = j\n j = j + 1\n temp = a[smallest]\n a[smallest] = a[i]\n a[i] = temp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":12445,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:26:56","func_code":"def reverse(a):\n i = 0\n m = len(a) - i - 1\n i = i + 1\n return m","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":27625,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 14:27:02","func_code":"def circumference(r):\n c = 2 * 3.141 * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":30101,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 14:27:02","func_code":"def area(r):\n a = 3.141 * (r * r)\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":30483,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:27:05","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n swap(a, i, j)\n a[len(a) - i - 1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":7302,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:27:09","func_code":"def selection_sort(a):\n c = 0\n while c < len(a):\n i = c + 1\n p = c\n while i < len(a):\n if a[p] > a[i]:\n p = i\n z = a[p]\n a[p] = a[c]\n a[c] = z\n i += 1\n c += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":31508,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:27:11","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":17112,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:27:11","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":23128,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:27:11","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":23442,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:27:11","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":19452,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:27:25","func_code":"def selection_sort(a):\n c = 0\n while c < len(a):\n i = c\n p = c\n while i < len(a):\n if a[p] > a[i]:\n p = i\n z = a[p]\n a[p] = a[c]\n a[c] = z\n i += 1\n c += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":8194,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 14:27:31","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":34595,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2017-11-28 14:27:31","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":26340,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 14:27:41","func_code":"def area(r):\n a = p * (r * r)\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10638,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 14:27:41","func_code":"def circumference(r):\n c = 2 * p * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":2569,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 14:27:41","func_code":"def circumference(r):\n c = 2 * p * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":15274,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 14:27:41","func_code":"def area(r):\n a = p * (r * r)\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20896,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:27:44","func_code":"def area(n):\n return 3.141 * n ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":17079,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:27:44","func_code":"def circumference(n):\n return 2 * 3.141 * n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":22920,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 14:27:45","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":22011,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 14:27:45","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":9643,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:27:54","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":25464,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:27:54","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":38124,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 14:27:57","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":19271,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 14:27:57","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":21995,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:28:18","func_code":"def selection_sort(a):\n c = 0\n while c < len(a):\n i = c\n p = c\n while i < len(a):\n if a[p] < a[i]:\n p = i\n z = a[p]\n a[p] = a[c]\n a[c] = z\n i += 1\n c += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":20913,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:28:21","func_code":"def circumference(x):\n cir = 2 * p * x\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":11581,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:28:21","func_code":"def area(x):\n ar = p * (x * x)\n return ar","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":15691,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:28:29","func_code":"def selection_sort(a):\n c = 0\n while c < len(a):\n i = c\n p = c\n while i < len(a):\n if a[p] > a[i]:\n p = i\n z = a[p]\n a[p] = a[c]\n a[c] = z\n i += 1\n c += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":20804,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:28:33","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = a[i]\n j = i\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = a[i]\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":33226,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:28:34","func_code":"def circumference(x):\n cir = 2 * p * x\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":2930,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:28:34","func_code":"def area(x):\n ar = p * (x * x)\n return ar","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":34427,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:28:46","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - i - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j + j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":4217,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:28:49","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":19612,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2017-11-28 14:28:49","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":20839,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:29:06","func_code":"def area(r):\n return r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":15427,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:29:06","func_code":"def circumference(r):\n return r * 3.141 * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":32461,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:29:33","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = a[i]\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = a[i]\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":12136,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 14:29:44","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":25791,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 14:29:44","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":32169,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:29:47","func_code":"def reverse(a):\n t = ''\n while i < len(a):\n t = a[j] + t\n j = j + 1\n return t","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":17643,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:29:54","func_code":"def circumference(r):\n return r * 3.141 * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":9360,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 14:29:54","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":18562,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:29:54","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":41405,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 14:29:54","func_code":"def circumference(r):\n return pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":3739,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:30:11","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = a[i]\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":2380,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:30:14","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":29899,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 14:30:16","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":5500,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 14:30:16","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":20091,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 14:30:16","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":16925,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 14:30:16","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":22341,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:30:19","func_code":"def reverse(a):\n b = []\n i = 0\n while i < len(a):\n b.append(a[len(a) - 1 - i])\n i = i + 1\n return b","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":18736,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:30:27","func_code":"def circumference(r):\n return r * 3.141 * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":31848,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:30:27","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":4476,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:30:48","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":42318,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:30:48","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":5450,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:30:48","func_code":"def circumference(r):\n return r * pi * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":36182,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:30:48","func_code":"def circumference(r):\n return r * pi * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":23293,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:30:48","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":33710,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2017-11-28 14:30:48","func_code":"def circumference(r):\n return r * pi * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":1437,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 14:30:55","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10364,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 14:30:55","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":13745,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 14:30:55","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":11496,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:30:55","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = a[i]\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34655,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 14:30:55","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33314,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:31:13","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":35508,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:31:13","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11216,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:31:17","func_code":"def circumference(n):\n return 2 * pi * n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":28397,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:31:17","func_code":"def area(n):\n return pi * n ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12664,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:31:17","func_code":"def area(n):\n return pi * n ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10872,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:31:17","func_code":"def circumference(n):\n return 2 * pi * n","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":2505,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:31:18","func_code":"def selection_sort(a):\n c = 0\n while c < len(a):\n i = c\n p = c\n while i < len(a):\n if a[p] > a[i]:\n p = i\n i += 1\n z = a[p]\n a[p] = a[c]\n a[c] = z\n c += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34224,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2017-11-28 14:31:18","func_code":"def selection_sort(a):\n c = 0\n while c < len(a):\n i = c\n p = c\n while i < len(a):\n if a[p] > a[i]:\n p = i\n i += 1\n z = a[p]\n a[p] = a[c]\n a[c] = z\n c += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":37721,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:31:19","func_code":"def double(n):\n return n * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":8244,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2017-11-28 14:31:24","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":37035,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2017-11-28 14:31:24","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:31:36","func_code":"def reverse(a):\n a = a[::-1]\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":18499,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:31:48","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[j] = a[i]\n j = tmp\n\n\ndef reverse(a):\n swap(a, i, j)\n i = 0\n while i < len(a):\n a[len(a) - i - 1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":15147,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:31:51","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":5385,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:31:51","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":21241,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:31:53","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n n = len(a) - i - 1\n while n < len(a) - 1:\n if a[j] < a[n]:\n swap(a, i, j)\n n = n + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":295,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 14:31:59","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j > len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, j)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12613,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:32:02","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":2078,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2017-11-28 14:32:02","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":1454,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:32:05","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":28863,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:32:10","func_code":"def reverse(a):\n t = ''\n while j < len(a):\n t = a[j] + t\n j = j + 1\n return t","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":9364,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:32:10","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[j] = a[i]\n j = tmp\n\n\ndef reverse(a):\n swap(a, i, j)\n i = 0\n while i < len(a):\n a[len(a) - i - 1]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":29109,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 14:32:13","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n swap(a, a[i], a[len(a) - i - 1])\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11843,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:32:15","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":4374,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:32:15","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13910,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 14:32:49","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j > len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, j)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":25495,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:32:50","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n n = len(a) - 1\n while n < len(a) \/ 2:\n if a[j] < a[n]:\n swap(a, i, j)\n n = n + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":33970,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 14:32:50","func_code":"def reverse(a):\n b = []\n i = 0\n while i < len(a):\n b.append(a[len(a) - 1 - i])\n i = i + 1\n return b","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":1535,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:32:56","func_code":"def reverse(a):\n t = ''\n while j < len(i):\n t = a[j] + t\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36147,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2017-11-28 14:32:59","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":14500,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2017-11-28 14:32:59","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17071,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2017-11-28 14:33:20","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":9835,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2017-11-28 14:33:20","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":25529,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:33:36","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":32820,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2017-11-28 14:33:36","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":17254,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:33:42","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j + j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":18676,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2017-11-28 14:33:48","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":29536,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2017-11-28 14:33:48","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":36857,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2017-11-28 14:33:48","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":15231,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2017-11-28 14:33:48","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":12013,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 14:33:58","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":20121,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 14:33:58","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":15831,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 14:33:58","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":9498,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 14:33:58","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26389,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:34:14","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":19063,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 14:34:14","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":6630,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:34:14","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":28340,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 14:34:14","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":28957,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:34:18","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8357,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:34:18","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":855,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:34:20","func_code":"def reverse(a):\n a = a[::-1]\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":1087,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:34:22","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":52,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:34:22","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":8957,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:34:22","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n swap(a, i, j)\n i = 0\n while i < len(a):\n x = a[len(a) - i - 1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":4234,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:34:36","func_code":"def reverse(a):\n t = ''\n while j < len(i):\n t = a[j] + t\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":35283,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:34:36","func_code":"def selection_sort(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":5315,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:34:58","func_code":"def area(r):\n return 3.141 * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":347,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:34:58","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":14828,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:34:59","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[j] = a[i]\n a[j] = tmp\n\n\ndef reverse(a):\n swap(a, i, j)","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20719,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 14:35:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[small]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41728,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2017-11-28 14:35:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[small]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34158,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:35:10","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n n = len(a) - 1\n while n < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n n = n - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8076,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:35:17","func_code":"def selection_sort(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":7351,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:35:23","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, j, len(a) - 1 - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":27644,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:35:27","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n swap(a, i, j)","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11366,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:35:35","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while j < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11857,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 14:35:36","func_code":"def smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest(a, i)\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":7725,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2017-11-28 14:35:36","func_code":"def smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest(a, i)\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":6750,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 14:35:36","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 1\n while i < len(a):\n j = i + 1\n swap(a, i, j)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":24707,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:35:47","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, j, len(a) - 1 - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":40698,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:36:02","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36012,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:36:05","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":553,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:36:05","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14303,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 14:36:05","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":22350,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:36:11","func_code":"def reverse(a):\n m = len(a) - i - 1\n return m","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":18134,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:36:19","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12719,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:36:29","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i1, len(a) - 1 - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20399,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:36:35","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":780,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:36:35","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":16362,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:36:35","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":311,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:36:35","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":9605,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:36:36","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a):\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":42122,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:36:36","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = a[len(a - i - 1)]\n swap(a, 0, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":3114,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2017-11-28 14:36:45","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":5964,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2017-11-28 14:36:45","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":40137,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2017-11-28 14:36:45","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":15918,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2017-11-28 14:36:45","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":29539,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 14:36:53","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":31281,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 14:36:53","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":32370,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2017-11-28 14:36:53","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30988,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2017-11-28 14:36:56","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":22038,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2017-11-28 14:36:56","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34306,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:36:57","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n swap(a, 4, 1)\n swap(a, 3, 2)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36336,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:36:59","func_code":"def circumference(r):\n x = 2 * pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":19867,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:36:59","func_code":"def circumference(r):\n x = 2 * pi * r\n return x","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":5051,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:36:59","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17744,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 14:36:59","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) - 1:\n j = i + 1\n swap(a, i, j)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14620,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:36:59","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36698,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:37:02","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":6151,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:37:02","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":32669,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:37:09","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = int(a[len(a - i - 1)])\n swap(a, 0, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":6765,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:37:12","func_code":"def selection_sort(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":456,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:37:14","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = a[j]\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a):\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":4593,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:37:25","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":22189,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:37:25","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":33853,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 14:37:55","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":4197,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 14:37:55","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":42291,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2017-11-28 14:37:55","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":34591,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 14:37:55","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":26570,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 14:37:55","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":2886,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:37:56","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41712,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2017-11-28 14:37:56","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":31143,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:37:58","func_code":"def reverse(a):\n x = len(a) - i - 1\n return x","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39691,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 14:38:01","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, a[i], a[len(a) - 1 - i])\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14560,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:38:04","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = int(a[len(a) - i - 1])\n swap(a, 0, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":22297,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:38:04","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":25987,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:38:04","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13868,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:38:05","func_code":"def reverse(a):\n t = ''\n while j < len(i):\n t = a[j] + t\n j = j + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38941,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 14:38:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":33806,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2017-11-28 14:38:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":36342,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:38:10","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30936,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 14:38:10","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13345,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:38:26","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12060,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:38:26","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":34947,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:38:26","func_code":"def reverse(a):\n x = len(a) - i - 1\n return x","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":42386,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:38:43","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = a[j]\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":26449,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:38:56","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":15532,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:38:56","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38358,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:39:05","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = a[0]\n j = len(a) - 1\n while i < j:\n a = swap(a)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36621,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:39:10","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13371,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 14:39:10","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12335,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:39:24","func_code":"def reverse(a):\n t = ''\n while j < len(i):\n t = a[j] + t\n j = j + 1\n return t","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":21300,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 14:39:43","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n swap(a, a[i], a[len(a) - i - 1])\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":19701,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:40:12","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n swap(a, i, len(a) - i - 1)","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":17155,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 14:40:15","func_code":"def reverse(a):\n while j < len(a):\n if a[j] > a[p]:\n p = j\n j = j + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":33412,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:40:16","func_code":"def swap(a, x, y):\n tmp = a[x]\n a[x] = a[y]\n a[y] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":39347,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:40:16","func_code":"def swap(a, x, y):\n tmp = a[x]\n a[x] = a[y]\n a[y] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":13712,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:40:19","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = int(a[len(a) - i - 1])\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11301,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:40:21","func_code":"def reverse(a):\n tmp = a[i]\n a[i] = [len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":23210,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 14:40:24","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n tmp = a[len(a) - 1 - i]\n a[len(a) - 1 - i] = a[i]\n a[i] = tmp\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":27960,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2017-11-28 14:40:25","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":35281,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2017-11-28 14:40:25","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":40780,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2017-11-28 14:40:25","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":41257,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2017-11-28 14:40:25","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":24186,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:40:27","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11308,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 14:40:43","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":18902,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 14:40:51","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":29740,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2017-11-28 14:40:51","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":2909,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2017-11-28 14:40:53","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":14209,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:41:17","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":32782,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:41:17","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30538,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:41:29","func_code":"def swap(a, i, p):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":1425,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:41:44","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = int(a[len(a) - i - 1])\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":18246,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2017-11-28 14:41:46","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37351,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2017-11-28 14:41:46","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":5788,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2017-11-28 14:41:46","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8933,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2017-11-28 14:41:48","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":3526,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:42:05","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":382,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:42:05","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20140,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2017-11-28 14:42:11","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n tmp = a[j]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11068,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 14:42:27","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) - 1:\n j = i + 1\n p = 0\n while p < len(a[i:]):\n swap(a, i, j)\n p += 1\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":9374,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:42:33","func_code":"def selection_sort(a):\n s = input()\n a = []\n while s != 'end':\n a.append(int(s))\n s = input()\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n i = 0\n while i < len(a):\n print(a[i])\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":14200,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2017-11-28 14:42:41","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":13738,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2017-11-28 14:42:41","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":31452,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2017-11-28 14:42:41","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":33413,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2017-11-28 14:42:41","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":17853,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2017-11-28 14:42:45","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":18352,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:42:45","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":5957,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2017-11-28 14:42:45","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34004,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2017-11-28 14:42:45","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":3797,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2017-11-28 14:42:48","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36122,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2017-11-28 14:42:48","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":7293,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 14:43:00","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13673,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 14:43:00","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36903,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:43:08","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = int(a[len(a) - i - 1])\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":5302,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2017-11-28 14:43:15","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n tmp = a[p]\n a[p] = a[j]\n a[j] = tmp\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":9112,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2017-11-28 14:43:15","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n tmp = a[p]\n a[p] = a[j]\n a[j] = tmp\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":39001,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:43:29","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[i]\n a[i] = [len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":10318,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:43:39","func_code":"def selection_sort(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":14553,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:43:41","func_code":"def swap(a, i, j):\n b = a\n tmp = b[j]\n b[j] = b[i]\n b[i] = tmp\n\n\ndef reverse(a):\n c = a\n while i < len(a):\n swap(c, c[i], c[len(c) - i - 1])\n i = i + 1\n return c","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12752,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:43:42","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":15472,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:43:42","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30566,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:43:47","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":13484,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:43:47","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = a[len(a) - i - 1]\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":22247,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:43:48","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n tmp = a[i]\n a[i] = [len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":28691,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:43:53","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":41477,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:43:53","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":10267,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:43:56","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n p = j\n j = j + 1\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":13252,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:43:57","func_code":"def reverse(a):\n while i < len(a) \/ 2:\n tmp = len(a) - i - 1\n a[i] = len(a) - i - 1\n a[i] = tmp\n return x","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":40898,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 14:44:17","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n j -= 1\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":547,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 14:44:17","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n j -= 1\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12623,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 14:44:20","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":1663,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 14:44:20","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":38957,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:44:22","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n p = j\n j = j + 1\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":38142,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 14:44:32","func_code":"def swap(a, i, j):\n a[i] = tmp\n a[j] = a[i]\n tmp = a[j]\n\n\ndef reverse(a, i, j):\n i = 0\n j = len(a) - 1\n while i < len(a):\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20479,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2017-11-28 14:44:42","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i\n p = j + 1\n while p < len(a):\n if a[p] < a[j]:\n j = p\n p += 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":10078,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2017-11-28 14:44:42","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i\n p = j + 1\n while p < len(a):\n if a[p] < a[j]:\n j = p\n p += 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":39819,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 14:44:52","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = -1\n while i < len(a):\n swap(a, i, j)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20397,"user":"3d2a254e-7beb-402f-8a24-1414f9d11b3c","date":"2017-11-28 14:45:21","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n func_reverse.reverse(a)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":6240,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 14:45:21","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":24669,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:45:28","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":26858,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:45:28","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":38790,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 14:45:32","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a, i, j):\n i = 0\n j = len(a) - 1\n while i < len(a):\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8403,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:45:38","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":7442,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2017-11-28 14:45:38","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":9359,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:45:42","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":3854,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 14:45:42","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":6587,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:46:13","func_code":"def smallest(a, i):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest(a, i)\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":6726,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 14:46:24","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = -1\n while i < len(a):\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30178,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:46:27","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":4453,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:46:27","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n tmp = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = tmp\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":32244,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:46:35","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":7701,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2017-11-28 14:46:35","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":38447,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:46:45","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, a[i], a[len(a) - i - 1])\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8437,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 14:46:46","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30470,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 14:46:46","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":22120,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:46:47","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n find_smallest_position(a, i)\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":37440,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:46:57","func_code":"def smallest(a, i):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n i = i + 1\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest(a, i)\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":21856,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:47:06","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = a[0]\n j = len(a) - 1\n while i < j:\n a = swap(a)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":4042,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:47:20","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37292,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:47:20","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":5002,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 14:47:21","func_code":"def swap(p, i):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n return a\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n swap(p, i)\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":5981,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:47:22","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":29746,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:47:22","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":6351,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 14:47:23","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a):\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":25099,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:47:31","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34310,"user":"e446f262-2121-4c37-a09e-a856c55efaca","date":"2017-11-28 14:47:31","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":37651,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 14:47:40","func_code":"def area(r):\n return pi * int(r) ^ 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4648,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 14:47:40","func_code":"def circumference(r):\n return 2 * pi * int(r)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":36335,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:47:54","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a):\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":17782,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 14:47:59","func_code":"def reverse(a):\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":3991,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:48:19","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":9000,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2017-11-28 14:48:19","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":17728,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 14:48:27","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":23086,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 14:48:27","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":17987,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 14:48:36","func_code":"def area(r):\n return 3.141 * (r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":28368,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 14:48:36","func_code":"def circumference(r):\n return r * 2 * 3.141","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":32960,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:48:36","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":5451,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 14:48:37","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":26792,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 14:48:37","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":9183,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 14:48:42","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":35914,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:48:42","func_code":"def double(n):\n return n * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":12146,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 14:48:42","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":42118,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 14:49:00","func_code":"def swap(a, p, i):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n return a\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n swap(a, p, i)\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":14777,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2017-11-28 14:49:00","func_code":"def swap(a, p, i):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n return a\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n swap(a, p, i)\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":19315,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:49:04","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39348,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 14:49:12","func_code":"def area(r):\n return pi * int(r) * int(r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":1272,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 14:49:12","func_code":"def circumference(r):\n return 2 * pi * int(r)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33896,"user":"3d2a254e-7beb-402f-8a24-1414f9d11b3c","date":"2017-11-28 14:49:17","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36675,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2017-11-28 14:49:17","func_code":"def double(n):\n d = n * 2\n return d","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":5714,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2017-11-28 14:49:17","func_code":"def double(n):\n d = n * 2\n return d","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17726,"user":"3d2a254e-7beb-402f-8a24-1414f9d11b3c","date":"2017-11-28 14:49:17","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":31892,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2017-11-28 14:49:17","func_code":"def double(n):\n d = n * 2\n return d","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":16967,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:49:22","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13063,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:49:22","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":41595,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:49:23","func_code":"def double(n):\n print(n * n)","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":false} {"submission_id":13794,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 14:49:25","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40815,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2017-11-28 14:49:25","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":15076,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:49:31","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a, i):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41902,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:49:32","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < j:\n swap(a)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":6648,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:49:40","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13336,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:49:41","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":34226,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 14:49:41","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":35270,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 14:49:48","func_code":"def area(r):\n return pi * (r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":14389,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 14:49:48","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":22371,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 14:49:48","func_code":"def area(r):\n return pi * (r * r)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":18571,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 14:49:48","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":21644,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 14:49:50","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35098,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 14:49:50","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":26090,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:49:50","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < j:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":10648,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 14:49:50","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < j:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":21438,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 14:49:50","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":39377,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 14:49:50","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36385,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:49:57","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":11881,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:49:57","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":28835,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2017-11-28 14:49:57","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":38672,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:49:57","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17602,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:49:59","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34250,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2017-11-28 14:49:59","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":2388,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:50:07","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":22934,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:50:08","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a):\n swap(a, i, j)\n i = i + 1\n j = j + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":9659,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 14:50:26","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":17817,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 14:50:26","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":24914,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2017-11-28 14:50:26","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":6941,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2017-11-28 14:50:32","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":18824,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2017-11-28 14:50:32","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11794,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:50:41","func_code":"def smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest(a, i)\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":12726,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:51:04","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13497,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 14:51:05","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":39764,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:51:13","func_code":"def smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":5424,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:51:27","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":34046,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:51:33","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = a[len(a) - 1]\n while i < len(a):\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11219,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 14:51:42","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = -1\n while i < len(a \/ 2):\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14169,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:51:49","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38068,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 14:51:49","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":2110,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 14:52:00","func_code":"def reverse(a):\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8997,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 14:52:06","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = -1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":22867,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 14:52:06","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = -1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":21441,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:52:22","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = [j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a)\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":24864,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:52:25","func_code":"def swap(a, p, i):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, p, i)\n i = i + 1\n return p","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":4915,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:52:35","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = [j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a)\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":22850,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:52:46","func_code":"def smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n j = smallest(a, i)\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40076,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:53:14","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a)\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37962,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:53:15","func_code":"def selection_sort(a, j, k):\n while i < len(a):\n j = i\n k = i\n while k < len(a):\n if a[j] > a[k]:\n k = j\n k = k + 1\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":15468,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:53:22","func_code":"def swap(a, p, i):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n return a\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, p, i)\n i = i + 1\n return p","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":2046,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:53:23","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i.p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":42462,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:53:38","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":7607,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 14:53:38","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14694,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2017-11-28 14:53:40","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":14479,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2017-11-28 14:53:40","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":15593,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:53:45","func_code":"def selection_sort(a):\n i = 0\n j = 0\n p = 0\n while i < len(a):\n j = i + 1\n p = i\n while j < len(a):\n if a[p] > a[j]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":7130,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2017-11-28 14:53:45","func_code":"def selection_sort(a):\n i = 0\n j = 0\n p = 0\n while i < len(a):\n j = i + 1\n p = i\n while j < len(a):\n if a[p] > a[j]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":2124,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 14:53:46","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n x = 0\n y = len(a)\n z = len(a) \/ 2\n while x < y:\n swap(x, y)\n x = x + 1\n y = y - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":35318,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:53:46","func_code":"def selection_sort(a):\n while i < len(a):\n j = i\n k = i\n while k < len(a):\n if a[j] > a[k]:\n k = j\n k = k + 1\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":12444,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:53:55","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i.p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":1227,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:53:56","func_code":"def smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":37998,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2017-11-28 14:53:56","func_code":"def smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":1508,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:54:14","func_code":"def swap(a, p, i):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n return a\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, p, i)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":40527,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2017-11-28 14:54:14","func_code":"def swap(a, p, i):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n return a\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, p, i)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":11862,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:54:16","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":32054,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:54:26","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":7666,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 14:54:26","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39018,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:54:27","func_code":"def selection_sort(a):\n while i < len(a):\n j = i\n k = i\n while k < len(a):\n if a[j] > a[k]:\n k = j\n k = k + 1\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":31499,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 14:54:39","func_code":"def reverse(a):\n return a[len(a) - 1:i]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":32580,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 14:54:44","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n x = 0\n y = len(a)\n z = len(a) \/ 2\n while x < y:\n swap(a, x, y)\n x = x + 1\n y = y - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":31261,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:54:46","func_code":"def selection_sort(a):\n j = 0\n while j < len(a):\n p = j\n i = j + 1\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n tmp = a[j]\n a[j] = a[p]\n a[p] = tmp\n j = j + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":12264,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2017-11-28 14:54:46","func_code":"def selection_sort(a):\n j = 0\n while j < len(a):\n p = j\n i = j + 1\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n tmp = a[j]\n a[j] = a[p]\n a[p] = tmp\n j = j + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":39832,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:54:59","func_code":"def selection_sort(a):\n i = 0\n p = 0\n j = 1\n while i < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40979,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 14:55:14","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1)","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39529,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:55:15","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":25859,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2017-11-28 14:55:15","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":26140,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2017-11-28 14:55:24","func_code":"def find_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest(a, i)\n swap(a, i, p)\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":1725,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2017-11-28 14:55:24","func_code":"def find_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest(a, i)\n swap(a, i, p)\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":37157,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2017-11-28 14:55:25","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = j - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":32916,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 14:55:39","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36803,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:55:47","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":36044,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2017-11-28 14:55:47","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":39906,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:55:48","func_code":"def selection_sort(a):\n i = 0\n p = 0\n j = len(a) - 1 - i\n while i < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":11586,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 14:56:10","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a))\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11295,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2017-11-28 14:56:11","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = -1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13597,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2017-11-28 14:56:11","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = -1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11718,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 14:56:12","func_code":"def selection_sort(a):\n while i < len(a):\n j = i\n k = i\n while k < len(a):\n if a[j] > a[k]:\n k = j\n k = k + 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":27583,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 14:56:15","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":42266,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 14:56:15","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":28251,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 14:56:20","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":33615,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:56:24","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":20975,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2017-11-28 14:56:24","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":3268,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:56:50","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40434,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2017-11-28 14:56:50","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34935,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 14:56:50","func_code":"def selection_sort(a):\n import func_reverse\n i = 0\n while i < len(a):\n j = i\n while j < len(a):\n if a[j] < a[i]:\n swap(a, i, j)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":39878,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:56:52","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = 0\n j = 1\n if a[j] < a[p]:\n p = j\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":19948,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 14:57:01","func_code":"def selection_sort(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":3505,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:57:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = 0\n j = 1\n if a[p] < a[j]:\n p = j\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":14505,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:57:10","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n m = len(a) - i - 1\n swap(a, i, m)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":17601,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2017-11-28 14:57:10","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n m = len(a) - i - 1\n swap(a, i, m)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":18679,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:58:04","func_code":"def area(r):\n return 3.141 * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":23724,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:58:04","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":16479,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:58:15","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":13302,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2017-11-28 14:58:15","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34818,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:58:35","func_code":"def area(r):\n return pi() * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":13621,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:58:35","func_code":"def circumference(r):\n return 2 * pi() * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":36174,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:58:40","func_code":"def selection_sort(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":30415,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 14:59:05","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":3590,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2017-11-28 14:59:15","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":9435,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2017-11-28 14:59:15","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":26408,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2017-11-28 14:59:15","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26761,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2017-11-28 14:59:15","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":40408,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2017-11-28 14:59:15","func_code":"def circumference(r):\n return r * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":637,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2017-11-28 14:59:15","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17720,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:59:17","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":28633,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:59:17","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":16276,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:59:17","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":19472,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 14:59:17","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20781,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 14:59:30","func_code":"def selection_sort(a):\n i = 0\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":19539,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:00:08","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < j:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":32551,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:00:08","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < j:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":9160,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 15:00:50","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":36080,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 15:00:50","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34513,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2017-11-28 15:00:50","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":39736,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 15:01:03","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":11160,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 15:01:56","func_code":"def swap(a, i, j):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":29541,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 15:02:07","func_code":"def selection_sort(a):\n i = 0\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":35544,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 15:02:16","func_code":"def selection_sort(a):\n while i < len(a):\n j = i\n k = i\n while k < len(a):\n if a[j] > a[k]:\n k = j\n k = k + 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":39315,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 15:02:52","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n print(a[i])\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":31573,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 15:02:59","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37996,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 15:03:20","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n print(a)","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":37361,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 15:03:29","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":16473,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2017-11-28 15:03:29","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":33808,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 15:03:48","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n print(a[i])\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":2752,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 15:03:50","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = a[i]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n a = swap(a, i, len(a) - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36003,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 15:05:03","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":29399,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 15:05:03","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":30476,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2017-11-28 15:05:03","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":21004,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 15:05:24","func_code":"def reverse(a):\n b = []\n i = 0\n while i < len(a):\n b.append(a[len(a) - 1 - i])\n i = i + 1\n return b","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":42124,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 15:05:56","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n x = 0\n y = len(a)\n while x < len(a):\n swap(a, x, y)\n x = x + 1\n y = y - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36052,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2017-11-28 15:05:58","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":24561,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2017-11-28 15:05:58","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":15113,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 15:06:06","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < 2 % len(a):\n swap(a, i, j)\n j = j - 1\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":28376,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 15:06:24","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = a[i]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n a = swap(a, i, len(a) - i)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":9600,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 15:06:29","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = p + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n a_tmp = a[p]\n a[p] = a[i]\n a[i] = a_tmp\n i = i + 1\n z = 0\n while z < len(a):\n print(a[z])\n z = z + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":35327,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2017-11-28 15:06:30","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":31705,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2017-11-28 15:06:30","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":3346,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2017-11-28 15:06:30","func_code":"def area(r):\n return PI * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":5207,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2017-11-28 15:06:30","func_code":"def area(r):\n return PI * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":19726,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2017-11-28 15:06:30","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":31157,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2017-11-28 15:06:30","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":31641,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2017-11-28 15:06:30","func_code":"def circumference(r):\n return 2 * PI * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":38720,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2017-11-28 15:06:30","func_code":"def circumference(r):\n return 2 * PI * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":13189,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 15:07:05","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n x = 0\n y = len(a)\n while x < len(a) \/ 2:\n swap(a, x, y)\n x = x + 1\n y = y - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":2962,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 15:07:07","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[j] = a[i]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a \/ 2):\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":25383,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 15:07:10","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = p + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n a_tmp = a[p]\n a[p] = a[i]\n a[i] = a_tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":17324,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 15:07:10","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = p + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n a_tmp = a[p]\n a[p] = a[i]\n a[i] = a_tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":35320,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2017-11-28 15:07:10","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = p + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n a_tmp = a[p]\n a[p] = a[i]\n a[i] = a_tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":22819,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-28 15:07:26","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":1450,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 15:07:53","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":28711,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 15:08:28","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n x = 0\n y = len(a)\n while x < len(a) \/ 2:\n swap(a, x, y - 1)\n x = x + 1\n y = y - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11324,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 15:08:28","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n x = 0\n y = len(a)\n while x < len(a) \/ 2:\n swap(a, x, y - 1)\n x = x + 1\n y = y - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":7126,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2017-11-28 15:08:28","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n x = 0\n y = len(a)\n while x < len(a) \/ 2:\n swap(a, x, y - 1)\n x = x + 1\n y = y - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":28104,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 15:08:33","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = a[i]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n a = swap(a, i, len(a) - i)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":25445,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:08:37","func_code":"def selection_sort(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":33113,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 15:08:49","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a \/ 2):\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":26803,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 15:08:58","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[j] = a[i]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":16390,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 15:09:50","func_code":"def reverse(a):\n b = []\n i = 0\n while i < len(a):\n b.append(a[len(a) - 1 - i])\n i = i + 1\n return b","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":33983,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 15:09:52","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i\n k = i\n while k < len(a):\n if a[j] > a[k]:\n k = j\n k = k + 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":27561,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 15:09:55","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":21896,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 15:09:55","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14810,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 15:10:00","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a \/ 2):\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":12312,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 15:10:07","func_code":"def swap(a, i, j):\n if a != []:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n else:\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n if a != []:\n while i < 2 % len(a):\n swap(a, i, j)\n j = j - 1\n i = i + 1\n return a\n else:\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13899,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 15:10:25","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n a = swap(a, i, len(a) - i)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":9703,"user":"3d2a254e-7beb-402f-8a24-1414f9d11b3c","date":"2017-11-28 15:10:35","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return i","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":25329,"user":"3d2a254e-7beb-402f-8a24-1414f9d11b3c","date":"2017-11-28 15:10:35","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return i","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41472,"user":"3d2a254e-7beb-402f-8a24-1414f9d11b3c","date":"2017-11-28 15:10:35","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return i","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40548,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:11:01","func_code":"def selection_sort(a):\n p = 0\n j = 0\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":38145,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-28 15:11:20","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":4090,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-28 15:11:20","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":40485,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-28 15:11:31","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":6558,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-28 15:11:31","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":24539,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 15:11:39","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n j = i\n while j < len(a):\n if a[j] < a[i]:\n swap(a, i, j)\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":6122,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2017-11-28 15:11:39","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n j = i\n while j < len(a):\n if a[j] < a[i]:\n swap(a, i, j)\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":29411,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 15:11:44","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":2204,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 15:11:44","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39773,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2017-11-28 15:11:49","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":13472,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2017-11-28 15:11:49","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":7166,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 15:11:57","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":6824,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 15:11:57","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38797,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-28 15:12:10","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":16477,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-28 15:12:10","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":9210,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-28 15:12:10","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":27870,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-28 15:12:10","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35372,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 15:12:18","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":25274,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 15:12:30","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":7599,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2017-11-28 15:12:30","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":6180,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 15:13:26","func_code":"def selection_sort(a):\n i = 0","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":4542,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 15:15:53","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n temp = a[j]\n a[j] = a[i]\n a[i] = temp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":35000,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 15:15:53","func_code":"def reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n temp = a[j]\n a[j] = a[i]\n a[i] = temp\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37128,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 15:16:13","func_code":"def reverse(a):\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":42441,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:16:19","func_code":"def selection_sort(a):\n n = input()\n a = []\n while n != 'end':\n a.append(int(n))\n n = input()\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[small]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1\n i = 0\n while i < len(a):\n print(a[i])\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":32637,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 15:16:29","func_code":"def swap(a, i, p):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort():\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":17389,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 15:16:38","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":31040,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2017-11-28 15:16:38","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":1610,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:16:44","func_code":"def selection_sort(a):\n while n != 'end':\n a.append(int(n))\n n = input()\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[small]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1\n i = 0\n while i < len(a):\n print(a[i])\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40973,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 15:16:54","func_code":"def swap(a, i, p):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":38410,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 15:16:54","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n a = swap(a, i, len(a) - i)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":19944,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2017-11-28 15:16:54","func_code":"def swap(a, i, p):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":5665,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2017-11-28 15:17:08","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40002,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2017-11-28 15:17:08","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":42481,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-28 15:17:18","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":42396,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:17:20","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[small]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1\n i = 0\n while i < len(a):\n print(a[i])\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":12992,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:17:46","func_code":"def selection_sort(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":38685,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:18:01","func_code":"def selection_sort(a):\n a.sort()","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":17430,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 15:18:03","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":22847,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2017-11-28 15:18:03","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":35316,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:18:06","func_code":"def selection_sort(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":27920,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:18:28","func_code":"def selection_sort(a):\n a = a.sorted()","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":39711,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:18:29","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n a[tmp] = a[i]\n a[i] = a[len(a) - i - 1]\n a[len(a) - i - 1] = a[tmp]\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":17416,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 15:18:36","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":18441,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 15:19:00","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":32343,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 15:19:10","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":27696,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2017-11-28 15:19:10","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":23079,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 15:19:19","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i + 1\n while j < len(a):\n if a[j] < a[i]:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n j = j + 1\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":28002,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2017-11-28 15:19:19","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i + 1\n while j < len(a):\n if a[j] < a[i]:\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n j = j + 1\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":21719,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 15:19:33","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n b.append(a[len(a) - 1 - i])\n i = i + 1\n return b","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":34713,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 15:19:59","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":35405,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 15:20:39","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n a = a + a[len(a) - i - 1]\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":3651,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 15:20:43","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":5390,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:20:51","func_code":"def swap(a, i, j):\n a[tmp] = a[i]\n a[i] = a[j]\n a[j] = a[tmp]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38703,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:21:33","func_code":"def swap(a, i, j):\n a[tmp] = a[j]\n a[j] = a[i]\n a[i] = a[tmp]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":21841,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 15:21:57","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":4574,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2017-11-28 15:21:57","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":38961,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 15:22:05","func_code":"def reverse(a):\n i = 0\n t = []\n while i < len(a):\n t = t + a[len(a) - i - 1]\n i = i + 1\n return t","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":29039,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 15:22:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[p] > a[j]:\n p = j\n j += 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":21512,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 15:22:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[p] > a[j]:\n p = j\n j += 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":6791,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2017-11-28 15:22:06","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[p] > a[j]:\n p = j\n j += 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":2015,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:22:12","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = atmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20225,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:22:24","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":42068,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:22:24","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39601,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 15:23:00","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":23535,"user":"d0bbdcdf-7e56-44f5-b27d-7b9822c0a1d6","date":"2017-11-28 15:23:00","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":24993,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 15:23:21","func_code":"def swap(a, i, j):\n if a != []:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n else:\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n if a != []:\n while i < 2 % len(a):\n swap(a, i, j)\n j = j - 1\n i = i + 1\n return a\n else:\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":919,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 15:24:28","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":237,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 15:24:42","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":34970,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 15:24:42","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":6444,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:25:11","func_code":"def selection_sort(a):\n a = a.sorted()","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":847,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:25:26","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[small]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1\n i = 0\n while i < len(a):\n print(a[i])\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":35401,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 15:25:54","func_code":"def selection_sort(a):\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n smallest(a, j, p)\n swap(a, i, p)\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":17902,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:26:07","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[small]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":32961,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:26:07","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[small]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":23832,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2017-11-28 15:26:07","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n small = i\n j = small + 1\n while j < len(a):\n if a[j] < a[small]:\n small = j\n j += 1\n tmp = a[small]\n a[small] = a[i]\n a[i] = tmp\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":39379,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 15:26:25","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":14946,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 15:26:25","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":40939,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2017-11-28 15:26:25","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":10406,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:27:07","func_code":"def selection_sort(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n a[j] = tmp\n a[p] = a[j]\n tmp = a[p]\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":18120,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 15:27:13","func_code":"def selection_sort(a):\n i = 0\n j = 0\n p = 0\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n while i < len(a):\n p = i\n j = i + 1\n smallest(a, j, p)\n swap(a, i, p)\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41948,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 15:28:46","func_code":"def swap(a, i, j):\n if a != []:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n else:\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n if a != [] and len(a) > 2:\n while i < 2 % len(a):\n swap(a, i, j)\n j = j - 1\n i = i + 1\n return a\n elif len(a) <= 2 and len(a) > 0:\n swap(a, i, j)\n return a\n else:\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":15481,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 15:29:20","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":4722,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2017-11-28 15:29:20","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":35001,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:29:36","func_code":"def selection_sort(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n a[i] = tmp\n a[p] = a[i]\n tmp = a[p]\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":28285,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2017-11-28 15:29:50","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":35030,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2017-11-28 15:29:50","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17583,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 15:30:03","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":33879,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 15:30:35","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n i = i + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":19177,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 15:31:30","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n i = i + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":24295,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 15:32:01","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n a = swap(a, i, len(a) - i)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14642,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:32:11","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n smallest = 0\n j = 1\n while j < len(a):\n if a[j] < a[smallest]:\n smallest = j\n j = j + 1\n tmp = a[0]\n a[0] = a[smallest]\n a[smallest] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":33552,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 15:32:57","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":11115,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 15:34:30","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":29375,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2017-11-28 15:34:30","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":36439,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:35:00","func_code":"def selection_sort(a):\n i = 0\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n a[i] = tmp\n a[p] = a[i]\n tmp = a[p]\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":25297,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 15:35:03","func_code":"def swap(a, i, j):\n if a != []:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n else:\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n if a != [] and len(a) > 2:\n while i < len(a) \/ 2:\n swap(a, i, j)\n j = j - 1\n i = i + 1\n return a\n elif len(a) <= 2 and len(a) > 0:\n swap(a, i, j)\n return a\n else:\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":21799,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 15:35:03","func_code":"def swap(a, i, j):\n if a != []:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n else:\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n if a != [] and len(a) > 2:\n while i < len(a) \/ 2:\n swap(a, i, j)\n j = j - 1\n i = i + 1\n return a\n elif len(a) <= 2 and len(a) > 0:\n swap(a, i, j)\n return a\n else:\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":3276,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 15:35:04","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1\n return p","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":38874,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 15:35:05","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i + 1\n j = p\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":33254,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 15:35:33","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":18648,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2017-11-28 15:35:33","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":36056,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 15:35:39","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":8327,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2017-11-28 15:35:39","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":25197,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 15:36:04","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n temp = a[p]\n a[p] = a[i]\n a[i] = temp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":33629,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2017-11-28 15:36:04","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n temp = a[p]\n a[p] = a[i]\n a[i] = temp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":10042,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:36:20","func_code":"def selection_sort(a):\n p = 0\n j = 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n a[j] = tmp\n a[p] = a[j]\n tmp = a[p]\n j = j + 1\n a[j] = tmp\n a[p] = a[j]\n tmp = a[p]\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":2451,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 15:36:36","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n k = 0\n while k < len(a) \/ 2:\n a = swap(a, k, len(a) - i)\n k = k + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":23104,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 15:37:12","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n k = 0\n while k < len(a) \/ 2:\n a = swap(a, k, len(a) - k)\n k = k + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":5044,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 15:38:13","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":31517,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 15:38:48","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":19061,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 15:38:48","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":33300,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2017-11-28 15:39:07","func_code":"def area(r):\n return 3.141 * 2 * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":6206,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2017-11-28 15:39:07","func_code":"def circumference(r):\n return 3.141 * 2 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":28845,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 15:39:17","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":25655,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2017-11-28 15:39:17","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":23144,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2017-11-28 15:40:40","func_code":"def area(r):\n return pi * 2 * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":17545,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2017-11-28 15:40:40","func_code":"def circumference(r):\n return pi * 2 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":5738,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:41:19","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef smallest_position(a):\n smallest = 0\n j = 1\n while j < len(a):\n if a[j] < a[smallest]:\n smallest = j\n j = j + 1\n return smallest\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest_position(a)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":30663,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2017-11-28 15:41:38","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":30579,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2017-11-28 15:41:38","func_code":"def circumference(r):\n return pi * 2 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":21483,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2017-11-28 15:41:38","func_code":"def circumference(r):\n return pi * 2 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":30231,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2017-11-28 15:41:38","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35961,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:41:40","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef smallest_position(a):\n smallest = 0\n j = 1\n while j < len(a):\n if a[j] < a[smallest]:\n smallest = j\n j = j + 1\n return smallest\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest_position(a)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":36116,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:42:05","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef smallest_position(a):\n smallest = 0\n j = 1\n while j < len(a):\n if a[j] < a[smallest]:\n smallest = j\n j = j + 1\n return smallest\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest_position(a)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":27635,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:42:34","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n a[i] = tmp\n a[p] = a[i]\n tmp = a[p]\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":18605,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 15:42:37","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4268,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 15:42:37","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":20438,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 15:42:37","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":15698,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 15:42:37","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":20862,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:43:25","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":16753,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:43:25","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":26859,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2017-11-28 15:43:25","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[i]\n a[i] = a[p]\n a[p] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":38087,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 15:46:46","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":14371,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2017-11-28 15:46:46","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":1801,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:51:12","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef smallest_position(a):\n smallest = 0\n j = 1\n while j < len(a):\n if a[j] < a[smallest]:\n smallest = j\n j = j + 1\n return smallest\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest_position(a[i:])\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":35546,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2017-11-28 15:51:12","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef smallest_position(a):\n smallest = 0\n j = 1\n while j < len(a):\n if a[j] < a[smallest]:\n smallest = j\n j = j + 1\n return smallest\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = smallest_position(a[i:])\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":10136,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 15:53:21","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":31773,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 15:53:21","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":41153,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:02:44","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":29756,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:02:44","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":35163,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:03:59","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":41364,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:03:59","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":36360,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:08:45","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":35700,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:08:45","func_code":"def area(r):\n return pi * r ** r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":21914,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:09:03","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":20656,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:09:03","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26559,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:09:03","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":3700,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:09:03","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":13008,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 16:15:00","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(l):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":24452,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:17:35","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30459,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:17:35","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":28636,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:26:25","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, p):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":21062,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-11-28 16:26:25","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, p):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":20767,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-28 16:29:12","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":40994,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:34:59","func_code":"def double(x):\n return x * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":5909,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:34:59","func_code":"def double(x):\n return x * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":21882,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:39:31","func_code":"def circumference(r):\n 3.141 * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":17653,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:39:31","func_code":"def area(r):\n 3.141 * r ^ 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":23556,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:40:06","func_code":"def area(r):\n 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12676,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:40:06","func_code":"def circumference(r):\n 3.141 * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":18592,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:40:52","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":36198,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:40:52","func_code":"def circumference(r):\n return 3.141 * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":41280,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:42:06","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":3375,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:42:06","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":12054,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:42:06","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":24563,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 16:42:06","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35473,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 16:49:48","func_code":"def double(x):\n y = x * 2\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":2659,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 17:01:11","func_code":"def swap(a, i, j):\n tmp = i\n i = j\n j = tmp\n return a\n\n\ndef reverse(a):\n while i < j:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":34878,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 17:01:36","func_code":"def swap(a, i, j):\n tmp = i\n i = j\n j = tmp\n\n\ndef reverse(a):\n while i < j:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":1004,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2017-11-28 17:01:36","func_code":"def swap(a, i, j):\n tmp = i\n i = j\n j = tmp\n\n\ndef reverse(a):\n while i < j:\n swap(a, i, j)\n i = i + 1\n j = j - 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":19480,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 17:03:22","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":6619,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 17:03:22","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":646,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 17:06:47","func_code":"def double(x):\n y = x * 2\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":18963,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 17:06:47","func_code":"def double(x):\n y = x * 2\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":40883,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 17:07:46","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef lowest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = lowest(a, i)\n swap(a, i, p)\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":24249,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 17:07:46","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef lowest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = lowest(a, i)\n swap(a, i, p)\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":30120,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2017-11-28 17:07:46","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef lowest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = lowest(a, i)\n swap(a, i, p)\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":24574,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 17:10:54","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":183,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 17:12:11","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":37663,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 17:12:11","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":36624,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 17:12:11","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":18256,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 17:12:11","func_code":"def area(r):\n return pi * r * r","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":21249,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 17:16:39","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":31769,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 17:16:39","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":2399,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 17:21:12","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, -(i + 1))\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":1638,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 17:21:12","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, -(i + 1))\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":17442,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 17:22:38","func_code":"def circumference(r):\n return 2 * 3.14 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":28255,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 17:22:38","func_code":"def area(r):\n return 3.14 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":18912,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 17:24:00","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":13093,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 17:24:00","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":4248,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 17:24:36","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":7758,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 17:24:36","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":37774,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 17:24:36","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":30623,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 17:24:36","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":6062,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 17:34:38","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":38388,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 17:34:38","func_code":"def double(n):\n m = n * 2\n return m","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":27132,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 17:47:31","func_code":"def circumference(r):\n pi = 3.141\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":26964,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 17:47:31","func_code":"def area(r):\n pi = 3.141\n a = pi * r * r\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":8610,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 17:47:57","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":29356,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 17:47:57","func_code":"def area(r):\n a = pi * r * r\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":36249,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 17:48:11","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":38343,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 17:48:11","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":3684,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 17:48:11","func_code":"def area(r):\n a = pi * r * r\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":21357,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 17:48:11","func_code":"def area(r):\n a = pi * r * r\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4146,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 18:07:13","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n a = swap(a, i, len(a) - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":11100,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 18:08:41","func_code":"def reverse(a):\n list(reversed(a))","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":34948,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 18:09:31","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n list(reversed(swap(a)))","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":23964,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 18:18:39","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":1490,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 18:18:39","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38943,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 18:22:46","func_code":"def swap(a, i, p):\n tmp = a[i]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = j + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":38504,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 18:24:21","func_code":"def swap(a, i, p):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = j + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40537,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:25:11","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":27051,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 18:26:09","func_code":"def swap(a, i, p):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":27328,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 18:26:09","func_code":"def swap(a, i, p):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":28036,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2017-11-28 18:26:09","func_code":"def swap(a, i, p):\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":8011,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:27:39","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":22504,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:27:39","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":38256,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:36:29","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":8578,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:36:29","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":21302,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:36:29","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":6149,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:36:29","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":28355,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 18:39:02","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14575,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 18:43:06","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":39381,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 18:47:10","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":35995,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 18:47:10","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":1195,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:51:11","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":23108,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:51:11","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":13669,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:55:43","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":4843,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:56:04","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":35378,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:56:04","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":26758,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2017-11-28 18:56:04","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":31119,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 18:56:31","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n j = i + 1\n while j < len(a):\n if a[j] < a[i]:\n swap(a, i, j)\n j = j + 1\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":12552,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2017-11-28 18:56:31","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n j = i + 1\n while j < len(a):\n if a[j] < a[i]:\n swap(a, i, j)\n j = j + 1\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":12804,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2017-11-28 19:49:56","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":7837,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2017-11-28 19:49:56","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":38949,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2017-11-28 19:53:38","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":36239,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2017-11-28 19:53:38","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":19941,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2017-11-28 19:53:38","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":25314,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2017-11-28 19:53:38","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":7733,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2017-11-28 20:02:54","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n j = j - 1\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39886,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2017-11-28 20:02:54","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n j = j - 1\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":40636,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2017-11-28 20:18:25","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n smallest = i\n j = i\n while j < len(a):\n if a[smallest] > a[j]:\n smallest = j\n j = j + 1\n tmp = a[i]\n a[i] = a[smallest]\n a[smallest] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":8234,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2017-11-28 20:18:25","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n smallest = i\n j = i\n while j < len(a):\n if a[smallest] > a[j]:\n smallest = j\n j = j + 1\n tmp = a[i]\n a[i] = a[smallest]\n a[smallest] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":20634,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 20:21:00","func_code":"def reverse(a):\n a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37520,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 20:24:02","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":35514,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 20:29:49","func_code":"def reverse(a):\n a = a[::-1]\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":22366,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 20:37:45","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":30985,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 20:37:45","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":32940,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 20:38:02","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n b.append(a[len(a) - 1 - i])\n i = i + 1\n return b","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20771,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-28 20:38:02","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n b.append(a[len(a) - 1 - i])\n i = i + 1\n return b","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30424,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 20:49:11","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n swap(a, p, i)\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":2890,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2017-11-28 20:49:11","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n swap(a, p, i)\n i += 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":21455,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 20:57:02","func_code":"def reverse(a):\n a = a[::-1]\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":1095,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 21:00:13","func_code":"def reverse(a):\n a = a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38516,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 21:05:47","func_code":"def reverse(a):\n b = a[::-1]\n return b","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":37265,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 22:24:31","func_code":"def reverse(a):\n a = a[::-1]\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":9155,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 22:24:52","func_code":"def reverse(a):\n a[::-1]\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":34737,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 22:37:34","func_code":"def reverse(a):\n for i in range(0, len(a) \/ 2):\n a[i], a[len(a) - 1 - i] = a[len(a) - 1 - i], a[i]\n print(a)","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39305,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 22:38:08","func_code":"def reverse(a):\n for i in range(0, len(a) \/ 2):\n a[i], a[len(a) - 1 - i] = a[len(a) - 1 - i], a[i]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":1937,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 22:38:08","func_code":"def reverse(a):\n for i in range(0, len(a) \/ 2):\n a[i], a[len(a) - 1 - i] = a[len(a) - 1 - i], a[i]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":40124,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-28 22:38:08","func_code":"def reverse(a):\n for i in range(0, len(a) \/ 2):\n a[i], a[len(a) - 1 - i] = a[len(a) - 1 - i], a[i]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36535,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 23:16:39","func_code":"def reverse(a):\n a.reverse()","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":5042,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2017-11-28 23:16:39","func_code":"def reverse(a):\n a.reverse()","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":24187,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 10:50:59","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":12214,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 10:50:59","func_code":"def double(n):\n return 2 * n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":15424,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-29 10:56:07","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n b.append(a[len(a) - 1 - i])\n i = i + 1\n return b","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":942,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-29 10:57:37","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n b.append(a[len(a) - 1 - i])\n i = i + 1\n a = b\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20546,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2017-11-29 10:57:37","func_code":"def reverse(a):\n i = 0\n while i < len(a):\n b.append(a[len(a) - 1 - i])\n i = i + 1\n a = b\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14212,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 10:58:21","func_code":"def area(x):\n print(int(x) ** 2 * 3.141)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":19367,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:00:22","func_code":"def circumference(x):\n print(int(x) * 2 * pi)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":39845,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:00:22","func_code":"def area(x):\n print(int(x) ** 2 * pi)","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":11517,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:01:09","func_code":"def area(x):\n return int(x) ** 2 * pi","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35529,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:01:09","func_code":"def circumference(x):\n return int(x) * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":11352,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:02:51","func_code":"def area(x):\n return float(x) ** 2 * pi","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":32405,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:02:51","func_code":"def circumference(x):\n return float(x) * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":27098,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:02:51","func_code":"def circumference(x):\n return float(x) * 2 * pi","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33886,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:02:51","func_code":"def area(x):\n return float(x) ** 2 * pi","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":6493,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2017-11-29 11:07:49","func_code":"def double(n):\n return n + n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":39428,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2017-11-29 11:07:49","func_code":"def double(n):\n return n + n","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":1090,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:11:30","func_code":"def swap(a, i, j):\n temp = a[i]\n a[i] = a[j]\n a[j] = temp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":22804,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:11:30","func_code":"def swap(a, i, j):\n temp = a[i]\n a[i] = a[j]\n a[j] = temp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - 1 - i)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":10624,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2017-11-29 11:19:33","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":40500,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2017-11-29 11:19:33","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":31913,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2017-11-29 11:19:33","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":38107,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2017-11-29 11:19:33","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":6668,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:22:39","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n temp = a[i]\n a[i] = a[p]\n a[p] = temp\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":32656,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2017-11-29 11:22:39","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n temp = a[i]\n a[i] = a[p]\n a[p] = temp\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":30506,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2017-11-29 11:42:35","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":27881,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2017-11-29 11:42:35","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":8619,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2017-11-29 11:42:35","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - 1 - i\n swap(a, i, j)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":23720,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 17:05:37","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":21385,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 17:05:37","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":10453,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 17:21:43","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":14975,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 17:21:43","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":6231,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 17:22:31","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":5311,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 17:22:31","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":39464,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 21:50:36","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":23625,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 21:50:36","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35024,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 21:50:36","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":18604,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 21:50:36","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26674,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 21:50:36","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":41095,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-29 21:50:36","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":26514,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2017-11-29 23:38:57","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":22938,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2017-11-29 23:38:57","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":39023,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2017-11-29 23:43:17","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":33117,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2017-11-29 23:43:17","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":606,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2017-11-29 23:43:17","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":25491,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2017-11-29 23:43:17","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":27767,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2017-11-29 23:43:17","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":4076,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2017-11-29 23:43:17","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":21445,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2017-11-30 00:02:11","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = -1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":37837,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2017-11-30 00:02:11","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = -1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":27197,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2017-11-30 00:02:11","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = -1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i += 1\n j -= 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8830,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 00:50:10","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":26923,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 00:58:48","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":36128,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:04:39","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":8497,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:06:17","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":37751,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:08:51","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":11551,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:09:46","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":15463,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:15:03","func_code":"def reverse(a):\n b = a[::-1]\n return b","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":16490,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:18:15","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":35368,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:20:00","func_code":"def reverse(a):\n print(a[::-1])\n return","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39111,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:23:25","func_code":"def reverse(a):\n print(a[::-1])\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":20425,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:24:10","func_code":"def reverse(a):\n print(a[::-1])\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14360,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:26:53","func_code":"def reverse(a):\n print(a[::-1])\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":17073,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:27:23","func_code":"def reverse(a):\n print(a[::-1])","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14572,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:28:01","func_code":"def reverse(a):\n print(a[::-1])","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":9708,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:30:17","func_code":"def reverse(a):\n print(a[::-1])","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":1268,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:31:13","func_code":"def reverse(a):\n print(a[::-1])","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":39097,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:31:30","func_code":"def reverse(a):\n a[::-1]\n return","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":17480,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:32:49","func_code":"def reverse(a):\n print(a[::-1])","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":7879,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2017-11-30 01:32:49","func_code":"def reverse(a):\n print(a[::-1])","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":30383,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-30 10:24:52","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < j:\n swap(a, i, j)\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":5013,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-30 10:24:52","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n j = len(a) - 1\n while i < j:\n swap(a, i, j)\n i = i + 1\n j = j - 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":40141,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-30 10:36:47","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":40681,"user":"32a14d12-9054-46cd-aa7e-4bf97d33fa10","date":"2017-11-30 10:36:47","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":26398,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-30 13:06:38","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":26009,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-30 13:06:38","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":25036,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-30 13:06:38","func_code":"def circumference(r):\n return pi * r * 2","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":7866,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-30 13:06:38","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":3304,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-30 13:12:38","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":14002,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-30 13:12:38","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8567,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-30 13:18:59","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, j)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":26471,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-30 13:19:32","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":34441,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2017-11-30 13:19:32","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":2673,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-30 14:21:22","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":21592,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-30 14:23:02","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":6774,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-30 14:23:36","func_code":"def reverse(a):\n a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":18550,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-30 14:24:30","func_code":"def reverse(a):\n print(a[::-1])","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":38424,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-30 14:25:11","func_code":"def reverse(a):\n return a[::-1]","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":21992,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-30 14:27:48","func_code":"def reverse(a):\n return a.reverse()","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":35191,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-30 14:27:48","func_code":"def reverse(a):\n return a.reverse()","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":32331,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-30 14:33:35","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":16696,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-30 14:35:46","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":977,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-30 14:35:46","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":10487,"user":"48db4273-a21e-41be-bca6-9b6444a15cbf","date":"2017-11-30 14:35:46","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":41628,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-11-30 16:11:47","func_code":"def intersection(a, b):\n c = []\n for i in a:\n if i in b and not i in c:\n c.append(i)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":false} {"submission_id":40899,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-11-30 16:11:47","func_code":"def union(a, b):\n c = []\n ab = a + b\n for i in ab:\n if not i in c:\n c.append(i)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":23554,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-11-30 16:14:29","func_code":"def union(a, b):\n c = []\n ab = a + b\n for i in ab:\n if not i in c:\n c.append(i)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":14877,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-11-30 16:14:29","func_code":"def intersection(a, b):\n c = []\n for i in a:\n if i in b and not i in c:\n c.append(i)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":31870,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-11-30 16:14:29","func_code":"def union(a, b):\n c = []\n ab = a + b\n for i in ab:\n if not i in c:\n c.append(i)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":17481,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-11-30 16:14:29","func_code":"def union(a, b):\n c = []\n ab = a + b\n for i in ab:\n if not i in c:\n c.append(i)\n return c","func_name":"union","assignment_id":"union","academic_year":2017,"module":"ca277","test":"assert union([],[])==[] and union([25785],[25785])==[25785] and union([-90, 21135, 29310, -8059, 7114, -90, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996],[5, -9316, 7379237229304681733])==[-90, 21135, 29310, -8059, 7114, -5808, 1333, -18691, 7, -19450, 67745575129021321678860432754396203799, -9288, -161403197171354040520992237328119268342, 49, 120528818203287557, 133011337445419463191476642795673848676, 11952, 11996, 5, -9316, 7379237229304681733]","description":"Merge two lists into a single one.","correct":true} {"submission_id":37383,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-11-30 16:14:29","func_code":"def intersection(a, b):\n c = []\n for i in a:\n if i in b and not i in c:\n c.append(i)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":4969,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-11-30 16:14:29","func_code":"def intersection(a, b):\n c = []\n for i in a:\n if i in b and not i in c:\n c.append(i)\n return c","func_name":"intersection","assignment_id":"intersection","academic_year":2017,"module":"ca277","test":"assert intersection([],[])==[] and intersection([20052, 20052, -9991],[102, 20052, -9991])==[20052, -9991] and intersection([38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794],[38908273694008580353068229963801163341, 59, 38908273694008580353068229963801163341, -38, 28239, -2723, 24559, -5794])==[38908273694008580353068229963801163341, 59, -38, 28239, -2723, 24559, -5794]","description":"Return the intersection between two lists.","correct":true} {"submission_id":8881,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-30 19:07:34","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":37582,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-30 19:07:34","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10187,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-30 19:07:34","func_code":"def area(r):\n a = pi * r ** 2\n return a","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":29513,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-30 19:07:34","func_code":"def circumference(r):\n c = 2 * pi * r\n return c","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":40637,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-30 19:55:44","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":8827,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-30 20:27:46","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":5872,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-30 20:27:46","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":2378,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-30 21:21:18","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n if a != str():\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1\n return a\n if a == str():\n b = []\n i = 0\n while i < len(a):\n b.append(a[len(a) - i - 1])\n print(b)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":29860,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-30 21:21:18","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n if a != str():\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1\n return a\n if a == str():\n b = []\n i = 0\n while i < len(a):\n b.append(a[len(a) - i - 1])\n print(b)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":36287,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2017-11-30 21:21:18","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n if a != str():\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n swap(a, i, p)\n i = i + 1\n return a\n if a == str():\n b = []\n i = 0\n while i < len(a):\n b.append(a[len(a) - i - 1])\n print(b)\n i = i + 1","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":24909,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2017-12-16 21:33:33","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef reverse(lst):\n i = len(lst) - 1\n for x in range(len(lst) \/ 2):\n swap(lst, x, i - x)\n return lst","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":15172,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2017-12-16 21:33:33","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef reverse(lst):\n i = len(lst) - 1\n for x in range(len(lst) \/ 2):\n swap(lst, x, i - x)\n return lst","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":33826,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2017-12-16 21:33:33","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef reverse(lst):\n i = len(lst) - 1\n for x in range(len(lst) \/ 2):\n swap(lst, x, i - x)\n return lst","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":35134,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2017-12-17 01:52:18","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef reverse(lst):\n i = 0\n while i < len(lst) \/ 2:\n swap(lst, i, len(lst) - 1 - i)\n i += 1\n return lst","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":30442,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2017-12-17 01:52:18","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef reverse(lst):\n i = 0\n while i < len(lst) \/ 2:\n swap(lst, i, len(lst) - 1 - i)\n i += 1\n return lst","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":29525,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2017-12-17 01:52:18","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef reverse(lst):\n i = 0\n while i < len(lst) \/ 2:\n swap(lst, i, len(lst) - 1 - i)\n i += 1\n return lst","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":24053,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 11:53:50","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":39356,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 11:53:50","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":26027,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:01:07","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":40036,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:01:07","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":14468,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:01:07","func_code":"def square_perimeter(n):\n result = 2 * (n + n)","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":20582,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:01:07","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":11645,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:01:07","func_code":"def square_area(n):\n result = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":false} {"submission_id":10671,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:01:27","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":21292,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:01:27","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":25011,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:01:27","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":18071,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:01:27","func_code":"def square_perimeter(n):\n result = 2 * (n + n)","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":27611,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:01:27","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":29477,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:02:26","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":30807,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:02:26","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3436,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:02:26","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":26830,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:02:26","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":11377,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:02:26","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":37377,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:02:26","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":33901,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:02:26","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":32293,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:02:26","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":29443,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:02:26","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":29711,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2017-12-21 12:02:26","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":16436,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-12-21 22:58:36","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_smallest\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":19426,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-12-21 22:59:36","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_smallest\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":29048,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-12-21 23:02:45","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_smallest\n swap(a, i, p)\n i = i + 1\n return p","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":16303,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-12-21 23:10:03","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n def find_position_smallest(a, i):\n p = i\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n return p\n\n def sort(a):\n i = 0\n while i < len(a):\n p = find_position_smallest\n swap(a, i, p)\n i = i + 1\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_smallest\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":22735,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-12-21 23:10:03","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n def find_position_smallest(a, i):\n p = i\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n return p\n\n def sort(a):\n i = 0\n while i < len(a):\n p = find_position_smallest\n swap(a, i, p)\n i = i + 1\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_smallest\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":13500,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2017-12-21 23:10:03","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n def find_position_smallest(a, i):\n p = i\n while i < len(a):\n if a[i] < a[p]:\n p = i\n i = i + 1\n return p\n\n def sort(a):\n i = 0\n while i < len(a):\n p = find_position_smallest\n swap(a, i, p)\n i = i + 1\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_smallest\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":false} {"submission_id":31610,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-12-29 19:37:20","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] < q:\n low = mid + 1\n else:\n high = mid\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":34959,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2017-12-29 19:37:20","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] < q:\n low = mid + 1\n else:\n high = mid\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":11069,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-01-06 13:52:02","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] < q:\n low = mid + 1\n else:\n high = mid\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":28239,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-01-06 13:52:02","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] < q:\n low = mid + 1\n else:\n high = mid\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":1837,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-01-06 13:52:02","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] < q:\n low = mid + 1\n else:\n high = mid\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":3740,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:19:47","func_code":"def double(n):\n ans = n * 2\n return ans","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":24697,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:19:47","func_code":"def double(n):\n ans = n * 2\n return ans","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":23354,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:27:37","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a[i], a[j]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":40607,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:27:37","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a[i], a[j]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":17208,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:29:58","func_code":"def circumference(r):\n circ = 2 * 3.141 * r\n return circ","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":3574,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:29:58","func_code":"def area(r):\n ar = r ** 2 * 3.141\n return ar","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":30065,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:30:28","func_code":"def circumference(r):\n pi = 3.141\n circ = 2 * pi * r\n return circ","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":30357,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:30:28","func_code":"def area(r):\n pi = 3.141\n ar = r ** 2 * pi\n return ar","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":40951,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:30:56","func_code":"def circumference(r):\n circ = 2 * pi * r\n return circ","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":2225,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:30:56","func_code":"def area(r):\n ar = r ** 2 * pi\n return ar","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":5837,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:30:56","func_code":"def circumference(r):\n circ = 2 * pi * r\n return circ","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33284,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:30:56","func_code":"def area(r):\n ar = r ** 2 * pi\n return ar","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":16272,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:36:40","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":8607,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-09 15:36:40","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":18355,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 21:44:38","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":11529,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 21:49:23","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20904,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 21:49:23","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":41847,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 21:49:40","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":30908,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 21:49:40","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":29883,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:23:36","func_code":"def reverse(a):\n a.reverse()\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":17955,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:27:25","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":4431,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:27:52","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":41881,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:29:37","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":6364,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:29:37","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":35228,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:29:37","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":40346,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:29:37","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":1009,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:29:38","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":35814,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:29:38","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":24721,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:29:38","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":3905,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:29:38","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":25851,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:44:09","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i\n while j < len(a):\n if a[i] > a[j]:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n j += 1\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":40094,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:49:54","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i\n while j < len(a):\n if a[i] > a[j]:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n j += 1\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":14827,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:49:54","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i\n while j < len(a):\n if a[i] > a[j]:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n j += 1\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":1855,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-01-09 22:49:54","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n j = i\n while j < len(a):\n if a[i] > a[j]:\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n j += 1\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":3957,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-10 08:58:52","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":38614,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-10 09:27:52","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = len(a) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q < a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":8000,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-10 09:28:19","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = len(a) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q < a[high + 1]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":15566,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-10 09:28:48","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = len(a) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":8134,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-10 09:29:47","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":25762,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-10 09:31:28","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":37578,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-10 09:31:28","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":14760,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 10:16:22","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":14284,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 10:16:22","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":14120,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:40:52","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q < a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":13509,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:41:28","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":30166,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:42:02","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":26320,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:46:40","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[mid] <= q\n if q < a[mid]:\n high = mid\n assert a[q] < a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":28607,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:47:05","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[mid] <= q\n if q < a[mid]:\n high = mid\n assert q < a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":32938,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:47:30","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[mid] <= q\n if q < a[mid]:\n high = mid\n assert q < a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":24263,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:48:29","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":4792,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:50:31","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if q < mid:\n low = mid\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":36333,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:50:58","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if q < mid:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":35913,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:51:26","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":6740,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:53:23","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= high\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":31255,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:53:50","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":12648,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:56:03","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if q < a[mid]:\n low = mid\n assert a[low - 1] < q\n else:\n high = mid\n assert q < a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":16746,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:56:43","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if q < a[mid]:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q < a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":29045,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:57:09","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q < a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":31410,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:57:31","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":2308,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:59:36","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":1024,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-11 11:59:36","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":5290,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-01-11 20:36:41","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":24559,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-01-11 20:36:41","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":5195,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-01-11 20:36:41","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":15528,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-01-11 20:48:45","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":796,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-01-11 20:49:01","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":2397,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-01-11 20:49:01","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":34294,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-01-11 20:49:01","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":16739,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 09:50:48","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":17318,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 10:39:51","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n elif q < a[mid]:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":6426,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 10:41:31","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":9418,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 17:44:05","func_code":"def swap(a, i, j):\n tmp = a[i]\n tmp1 = a[j]\n a[i] = tmp1\n a[j] = tmp\n\n\ndef reverse(a):\n i = 0\n j = len(a) - i - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":31940,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 17:45:57","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a[i], a[j]\n\n\ndef reverse(a):\n i = 0\n j = len(a) - i - 1\n while i < len(a) \/ 2:\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":false} {"submission_id":28586,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 17:46:28","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a[i], a[j]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":2686,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 17:46:28","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n return a[i], a[j]\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n swap(a, i, len(a) - i - 1)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":20294,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 17:47:03","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":22699,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 17:47:03","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i = i + 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":36517,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 17:58:57","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n if q < a[high]:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":17052,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 17:59:26","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n if q < a[mid]:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":16948,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 17:59:45","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n if q < a[mid]:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":4442,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 18:00:15","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":36854,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-12 18:00:15","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":1660,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-13 11:15:22","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":12800,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-01-13 11:15:22","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert a[low - 1] < q\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":41558,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-02-16 21:22:53","func_code":"def swap_keys_values(d):\n return dict([(v, k) for k, v in list(d.items())])","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":42045,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-02-16 21:22:53","func_code":"def swap_keys_values(d):\n return dict([(v, k) for k, v in list(d.items())])","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":31532,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-02-16 21:23:04","func_code":"def swap_unique_keys_values(d):\n return dict([(v, k) for k, v in list(d.items()) if list(d.values()).\n count(v) == 1])","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":8574,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-02-16 21:23:04","func_code":"def swap_unique_keys_values(d):\n return dict([(v, k) for k, v in list(d.items()) if list(d.values()).\n count(v) == 1])","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":36723,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:46:05","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18772,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:46:05","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10323,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:46:05","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4470,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:48:48","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14604,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:48:48","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":42137,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:48:48","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21344,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:48:48","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4329,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:48:48","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38147,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:48:48","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":468,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:48:48","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":30680,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:48:48","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33471,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-19 20:48:48","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3647,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 22:45:01","func_code":"def weird_case(some_str):\n weird = []\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n weird.append(some_str[i].upper())\n else:\n weird.append(some_str[i])\n i += 1\n return ''.join(weird)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33898,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 22:45:01","func_code":"def remove_zeros(list):\n for i in list:\n if i == 0:\n list.remove[i]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":17454,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 22:45:01","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n return l3[0::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":40297,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 22:45:43","func_code":"def merge_lists(l1, l2):\n return l1[0::2] + l2[0::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11132,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 22:45:43","func_code":"def remove_zeros(list):\n for i in list:\n if i == 0:\n list.remove[i]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23802,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 22:45:43","func_code":"def weird_case(some_str):\n weird = []\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n weird.append(some_str[i].upper())\n else:\n weird.append(some_str[i])\n i += 1\n return ''.join(weird)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3816,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 22:46:25","func_code":"def weird_case(some_str):\n weird = []\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n weird.append(some_str[i].upper())\n else:\n weird.append(some_str[i])\n i += 1\n return ''.join(weird)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":312,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 22:46:25","func_code":"def remove_zeros(list):\n for i in list:\n if i == 0:\n list.remove[i]\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":40220,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 22:46:25","func_code":"def merge_lists(l1, l2):\n return l1[0::2] + l2[0::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17898,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 23:07:32","func_code":"def weird_case(some_str):\n weird = []\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n weird.append(some_str[i].upper())\n else:\n weird.append(some_str[i])\n i += 1\n return ''.join(weird)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19111,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 23:07:32","func_code":"def weird_case(some_str):\n weird = []\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n weird.append(some_str[i].upper())\n else:\n weird.append(some_str[i])\n i += 1\n return ''.join(weird)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32752,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 23:07:32","func_code":"def remove_zeros(list):\n while 0 in list:\n for i in list:\n if i == 0:\n list.remove(i)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":21282,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 23:07:32","func_code":"def remove_zeros(list):\n while 0 in list:\n for i in list:\n if i == 0:\n list.remove(i)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":11074,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 23:07:32","func_code":"def merge_lists(l1, l2):\n return l1[0::2] + l2[0::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2509,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 23:07:32","func_code":"def merge_lists(l1, l2):\n return l1[0::2] + l2[0::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11659,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 23:07:32","func_code":"def merge_lists(l1, l2):\n return l1[0::2] + l2[0::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13857,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 23:07:32","func_code":"def remove_zeros(list):\n while 0 in list:\n for i in list:\n if i == 0:\n list.remove(i)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":14798,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-20 23:07:32","func_code":"def weird_case(some_str):\n weird = []\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n weird.append(some_str[i].upper())\n else:\n weird.append(some_str[i])\n i += 1\n return ''.join(weird)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15730,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:08:06","func_code":"def remove_zeros(list):\n while 0 in list:\n for i in list:\n if i == 0:\n list.remove(i)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":40915,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:08:06","func_code":"def weird_case(some_str):\n weird = []\n i = True\n for char in some_str:\n weird += char.upper() if i else char\n if char != ' ':\n i = not i\n return ''.join(weird)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19902,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:08:06","func_code":"def merge_lists(l1, l2):\n return l1[0::2] + l2[0::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33054,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:17:47","func_code":"def weird_case(some_str):\n weird, i = [], True\n for char in some_str:\n weird += char.upper() if i else char\n if char != ' ':\n i = not i\n return ''.join(weird)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6486,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:17:47","func_code":"def weird_case(some_str):\n weird, i = [], True\n for char in some_str:\n weird += char.upper() if i else char\n if char != ' ':\n i = not i\n return ''.join(weird)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8342,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:17:47","func_code":"def remove_zeros(list):\n while 0 in list:\n for i in list:\n if i == 0:\n list.remove(i)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":30588,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:17:47","func_code":"def merge_lists(l1, l2):\n return l1[0::2] + l2[0::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27627,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:17:47","func_code":"def remove_zeros(list):\n while 0 in list:\n for i in list:\n if i == 0:\n list.remove(i)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":41070,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:17:47","func_code":"def remove_zeros(list):\n while 0 in list:\n for i in list:\n if i == 0:\n list.remove(i)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":42004,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:17:47","func_code":"def merge_lists(l1, l2):\n return l1[0::2] + l2[0::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20066,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:17:47","func_code":"def merge_lists(l1, l2):\n return l1[0::2] + l2[0::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":16061,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-02-21 00:17:47","func_code":"def weird_case(some_str):\n weird, i = [], True\n for char in some_str:\n weird += char.upper() if i else char\n if char != ' ':\n i = not i\n return ''.join(weird)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39834,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:00:44","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n some_str[i] = some_str[i].upper()\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":12985,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:00:44","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":7224,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:00:44","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":3857,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:02:24","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":19687,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:02:24","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[i])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":35783,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:02:24","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n some_str[i] = some_str[i].upper()\n i = i + 1\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37243,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:24","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n some_str[i] = some_str[i].upper()\n i = i + 1\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24626,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:24","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":9795,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:24","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":5839,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:53","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n some_str[i] = some_str[i].upper()\n i = i + 1\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":34447,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:53","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":15629,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:53","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":40058,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:53","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37090,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:53","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n some_str[i] = some_str[i].upper()\n i = i + 1\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19618,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:53","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25870,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:53","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":23524,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:53","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n if i % 2 == 0:\n some_str[i] = some_str[i].upper()\n i = i + 1\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1178,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-21 13:05:53","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17787,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:19:29","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33306,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:20:00","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2338,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:22:07","func_code":"def merge_lists(l1l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1) \/ 2:\n l3.append(l1[i])\n l3.append(l2[i])\n i = i + 2\n j = j + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":23495,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:22:36","func_code":"def merge_lists(l1l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1) \/ 2:\n l3.append(l1[i])\n l3.append(l2[i])\n i = i + 2\n j = j + 2\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":6250,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:23:47","func_code":"def merge_lists(l1l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1) \/ 2:\n l3.append(l1[i])\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":8196,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:23:59","func_code":"def merge_lists(l1l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1) \/ 2:\n l3.append(l1[i])\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33341,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:24:12","func_code":"def merge_lists(l1l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1) \/ 2:\n l3.append(i)\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":23161,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:24:27","func_code":"def merge_lists(l1l2):\n i = 0\n l3 = []\n while i < len(l1) \/ 2:\n l3.append(i)\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":1332,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:24:40","func_code":"def merge_lists(l1l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(i)\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":26266,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:26:21","func_code":"def merge_lists(l1l2):\n i = 0\n l3 = []\n while i < len(l1) \/ 2:\n if l1[i] in l1:\n l3.append(l1[i])","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22494,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:26:38","func_code":"def remove_zeros(list):\n i = 0\n if list[i] == 0:\n del list[i]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":39743,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:26:38","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24643,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:27:35","func_code":"def merge_lists(l1l2):\n return l1l2[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":19609,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:27:50","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":19438,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:27:50","func_code":"def remove_zeros(list):\n i = 0\n if list[i] == 0:\n list.remove(list[i])","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":20433,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:28:54","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1) and i < len(l2):\n l3 = l1[i] + l2[i]\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":16315,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:29:18","func_code":"def merge_lists(l1l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":11497,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:29:30","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":12961,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:29:30","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22546,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:29:41","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":26348,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:29:41","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3945,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:30:00","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23544,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:30:30","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14737,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:30:30","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38329,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:30:37","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1) \/ 2:\n if l1[i] in l1:\n l3.append(l1[i])","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":16826,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:30:50","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1) \/ 2:\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":3954,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:31:03","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1) \/ 2:\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":38493,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:31:18","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":3381,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:31:57","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = str(l1_1) + str(l2_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":26179,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:32:25","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = str(l1_1) + str(l2_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15985,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:32:36","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n elif l2[i] in l2:\n l3.append(l2[i])\n i = i + 2\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":29004,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:32:44","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = str(l1_1) + str(l2_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":40081,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:32:59","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4492,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:32:59","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":1267,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:33:13","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append[l1[i], l2[i]]\n i = i + 2\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":37291,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:33:21","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":19395,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:33:22","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31320,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:33:22","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == '0':\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":3202,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:33:28","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append[l1, l2]\n i = i + 2\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":42260,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:33:42","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1, l2[i])\n i = i + 2\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":38912,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:33:44","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":913,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:33:44","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":27654,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:33:54","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i], l2[i])\n i = i + 2\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15760,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:34:09","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":5705,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:34:22","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3.append(l1_1, l2_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":7931,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:34:29","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n print(l3)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15282,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:34:41","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n l3.append(l2[iS])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":26286,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:34:41","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1, l2_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":37224,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-21 13:34:52","func_code":"def merge_lists(l1, l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1) and j < len(l2):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n elif l2[i] in l2:\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":27384,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:34:55","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":19107,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:35:09","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":6096,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:36:07","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n print(l1_1)\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":3553,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:36:28","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n print(l1_1)\n i += 1\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":40258,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-21 13:36:31","func_code":"def merge_lists(l1, l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1) and j < len(l2):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n elif l2[j] in l2:\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":3356,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:36:58","func_code":"def merge_lists(l1, l2):\n i = 0\n while i <= len(l1):\n l1_1 = l1[i]\n print(l1_1)\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":20968,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:37:21","func_code":"def merge_lists(l1, l2):\n i = 0\n while i <= len(l1):\n l1_1 = l1[0:2]\n print(l1_1)\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":30929,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-21 13:37:21","func_code":"def merge_lists(l1, l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1) and j < len(l2):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n elif l2[j] in l2:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":30403,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-21 13:37:35","func_code":"def merge_lists(l1, l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1) and j < len(l2):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n elif l2[j] in l2:\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":41783,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:37:46","func_code":"def merge_lists(l1, l2):\n i = 0\n while i <= len(l1):\n l1_1 = l1[0:]\n print(l1_1)\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":11438,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:38:12","func_code":"def merge_lists(l1, l2):\n i = 0\n while i <= len(l1):\n l1_1 = l1[0:3]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":27622,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:38:23","func_code":"def merge_lists(l1, l2):\n i = 0\n while i <= len(l1):\n l1_1 = l1[0, 3]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":20134,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:38:50","func_code":"def merge_lists(l1, l2):\n i = 0\n while i <= len(l1):\n l1_1 = l1[0], l1[2]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":24501,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 13:38:59","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37731,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-21 13:39:46","func_code":"def merge_lists(l1, l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n while j < len(l2):\n if l2[j] in l2:\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37400,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-21 13:39:46","func_code":"def merge_lists(l1, l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n while j < len(l2):\n if l2[j] in l2:\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3494,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-21 13:39:46","func_code":"def merge_lists(l1, l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n while j < len(l2):\n if l2[j] in l2:\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34214,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:40:06","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":18698,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:40:55","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30683,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:40:55","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7435,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:40:55","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":73,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:40:55","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":5692,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:40:55","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":343,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-21 13:40:55","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":22549,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:41:14","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1) and l3.append(l2_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":7673,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:41:27","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1), l3.append(l2_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":7260,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:41:49","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1), '6', l3.append(l2_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":37713,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:41:56","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34912,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:41:56","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list) == 0:\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":3699,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:42:11","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1), l3.append(6), l3.append(l2_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":39607,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:42:31","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1_1 = l1[i]\n i += 2\n j = 0\n while j < len(l2):\n l2_1 = l2[j]\n j += 2\n l3 = []\n l3.append(l1_1), l3.append(l2_1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":36736,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:42:36","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list) == 0:\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":24799,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:42:36","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":29494,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:43:15","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":35952,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:43:15","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25275,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:43:40","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":16285,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:43:40","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":28529,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:43:40","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25466,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:43:40","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":8557,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:43:40","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13177,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-21 13:43:40","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8741,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:44:21","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[i])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33076,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:44:39","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":40852,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 13:46:12","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37783,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 13:46:12","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n some_str[i].upper()\n i = i + 2\n j = 1\n while j < len(some_str):\n if some_str[j].isalpha():\n some_str[j].lower()\n j = j + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31750,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:46:44","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[i])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":8258,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:47:04","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31064,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:50:05","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":41073,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:50:05","func_code":"def weird_case(some_str):\n i = 0\n string2 = ''\n while i < len(some_str):\n string2 = some_str[i].upper()\n i += 2\n return string2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25660,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 13:51:56","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18788,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 13:51:56","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n some_str[i].upper()\n i = i + 2\n j = 1\n while j < len(some_str):\n if some_str[j].isalpha():\n some_str[j].lower()\n j = j + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40812,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 13:51:56","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23696,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:52:49","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.split(' ')\n return some_str\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14726,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:52:49","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27943,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:52:59","func_code":"def weird_case(some_str):\n i = 0\n string2 = ''\n while i < len(some_str):\n some_str = some_str.split()\n string2 = some_str[i].upper()\n i += 2\n return string2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11328,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:52:59","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":23939,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 13:53:01","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":34213,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:53:12","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.split(' ')\n return some_str[i]\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36384,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:53:12","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28933,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:53:24","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.split(' ')\n return some_str[i]\n i += 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":9566,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:53:24","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27136,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:53:28","func_code":"def weird_case(some_str):\n i = 0\n string2 = ''\n while i < len(some_str):\n some_str = some_str.split()\n string2 = str(some_str[i]).upper()\n i += 2\n return string2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35152,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:53:28","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":32692,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:53:52","func_code":"def weird_case(some_str):\n i = 0\n string2 = ''\n while i < len(some_str):\n some_str = some_str.split()\n print(some_str)\n i += 2\n return string2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25251,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:53:52","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":29558,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 13:54:05","func_code":"def merge_lists(l1, l2):\n l3 = list(set(l1 + l2))\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31203,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:54:10","func_code":"def weird_case(some_str):\n i = 0\n string2 = ''\n while i < len(some_str):\n some_str = str(some_str).split()\n print(some_str)\n i += 2\n return string2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19050,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:54:10","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":3107,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:54:17","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.split(' ')\n new_str = some_str.splt()\n return new_str[i]\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1396,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:54:17","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14624,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:54:28","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3527,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:54:28","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.split(' ')\n new_str = some_str.spIlt()\n return new_str[i]\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":9330,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:54:38","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.split(' ')\n new_str = some_str.spilt()\n return new_str[i]\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16714,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:54:38","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":15474,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:54:58","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.split(' ')\n new_str = some_str.split()\n return new_str[i]\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18345,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:54:58","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13048,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 13:55:03","func_code":"def merge_lists(l1, l2):\n l3 == l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":17820,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 13:55:05","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14310,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:55:19","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.split(' ')\n new_str = some_str.split()\n return new_str[i]\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35399,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:55:19","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22516,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 13:55:35","func_code":"def merge_lists(l1, l2):\n l3 == l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":39288,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:55:40","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28742,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:55:40","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.split()\n return new_str[i]\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22030,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 13:55:48","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33098,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:55:54","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.split()\n return some_str[i]\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25755,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:55:54","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30995,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 13:55:57","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":40435,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 13:56:05","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":5071,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:56:08","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.split()\n return some_str\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":23364,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:56:08","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34790,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 13:57:10","func_code":"def weird_case(some_str):\n new_str = some_str[0::2], isupper\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":7908,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 13:57:10","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41765,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 13:57:30","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6708,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 13:57:30","func_code":"def weird_case(some_str):\n new_str = some_str[0::2], isupper()\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32953,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 13:57:42","func_code":"def weird_case(some_str):\n new_str = some_str[0::2].isupper()\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39995,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 13:57:42","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6833,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 13:58:34","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20005,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 13:58:34","func_code":"def weird_case(some_str):\n s2 = some_str[0::2].upper()\n return s2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22031,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:58:35","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str[i].split(' ')\n return some_str\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":9123,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:58:35","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":10347,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 13:58:41","func_code":"def weird_case(some_str):\n new_str = some_str[0::2].isalpha()\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29339,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 13:58:41","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23884,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:58:48","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str[i].split()\n return some_str\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31654,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 13:58:48","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12907,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:58:53","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":23667,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:58:53","func_code":"def weird_case(some_str):\n i = 0\n string2 = ''\n while i < len(some_str):\n some_str = some_str[i].split()\n print(some_str)\n i += 2\n return string2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26526,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 13:59:13","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":29302,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 13:59:13","func_code":"def weird_case(some_str):\n return some_str.upper()[::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22767,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:59:25","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":16928,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 13:59:25","func_code":"def weird_case(some_str):\n i = 0\n string2 = ''\n while i < len(some_str):\n some_str = some_str[i].split()\n string2 = some_str[i].upper()\n i += 2\n return string2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":23119,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 13:59:33","func_code":"def weird_case(some_str):\n new_str = some_str[0::2].alpha()\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20661,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 13:59:33","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18585,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:00:11","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14799,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:00:11","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str[i].split()\n new_str = some_str[i].upper()\n return some_str\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8899,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:00:23","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7539,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:00:23","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str[i].split()\n new_str = some_str[i].upper()\n return some_str\n i += 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25971,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:00:28","func_code":"def weird_case(some_str):\n s1 = some_str[1::3].lower()\n s2 = some_str[0::2].upper()\n s3 = s1 + s2\n return s3","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31591,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:00:28","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8744,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:00:37","func_code":"def weird_case(some_str):\n if some_str != ' ':\n return some_str.upper()[::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40652,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:00:37","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":42142,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:00:54","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":32328,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:00:54","func_code":"def weird_case(some_str):\n if some_str[i] != ' ':\n return some_str.upper()[::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22075,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:00:58","func_code":"def weird_case(some_str):\n i = 0\n new_str = ''\n while i < len(some_str):\n some_str = some_str[i].split()\n new_str = some_str[i].upper()\n i += 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28140,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:00:58","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17793,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:01:17","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":20421,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:01:17","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17007,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:01:17","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n if some_str[i]:\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str[i].upper()\n else:\n new_str = new_str + some_str[i].lower()\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26118,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:01:42","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39883,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:01:42","func_code":"def weird_case(some_str):\n i = 0\n new_str = ''\n while i < len(some_str):\n some_str = some_str[i].split()\n new_str = some_str[i].upper()\n i += 2\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40617,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:03:33","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14019,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:03:33","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24671,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:03:33","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str[i].upper()\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3902,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:03:48","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":5951,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:03:48","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str[i].upper()\n else:\n new_str = new_str + some_str[i].lower()\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37280,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:03:48","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11199,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:05:03","func_code":"def weird_case(some_str):\n new_str = some_str[0::2].upper()\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38039,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:05:03","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11007,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:05:22","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":1314,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:05:22","func_code":"def weird_case(some_str):\n if some_str != ' ':\n return some_str.upper()[::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":41939,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:05:27","func_code":"def weird_case(some_str):\n new_str = some_str[0::2]\n return new_str.upper()","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29644,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:05:27","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":21904,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:06:27","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20108,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:06:27","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23310,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:06:27","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n some_str1 = some_str.split()\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str1[i].upper()\n else:\n new_str = new_str + some_str1[i].lower()\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33461,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:07:03","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28949,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:07:03","func_code":"def weird_case(some_str):\n new_str = some_str.upper()\n return new_str[0::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37573,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:07:26","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":3613,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:07:26","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n if some_str.isalpha():\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str[i].upper()\n else:\n new_str = new_str + some_str[i].lower()\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10235,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:07:26","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":1895,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:08:45","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n some_str = some_str[i].split()\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str.upper()\n else:\n new_str = new_str + some_str.lower()\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28225,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:08:45","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":40313,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:08:45","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":18121,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:09:28","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n some_str = some_str[i].split().upper()\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str.upper()\n else:\n new_str = new_str + some_str.lower()\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18244,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:09:28","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23229,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:09:28","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33052,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:09:45","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n some_str = some_str[i].split().upper()\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str\n else:\n new_str = new_str + some_str\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22175,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:09:45","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":36138,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:09:45","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41033,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:10:16","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14206,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:10:16","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":6425,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:10:16","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n some_str = some_str[i].split().upper()\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str.upper()\n else:\n new_str = new_str + some_str.lower()\n i = i + 1\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39772,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:10:31","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40922,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:10:31","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n some_str = some_str[i].split()\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str.upper()\n else:\n new_str = new_str + some_str.lower()\n i = i + 1\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26363,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:10:31","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25333,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:10:49","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":34583,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:10:49","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20529,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:10:49","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n some_str = some_str[i].split()\n i = i + 1\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11057,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:11:13","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17178,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:11:13","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40970,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:11:16","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 not in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":14765,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:11:16","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28197,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:11:16","func_code":"def weird_case(some_str):\n if some_str != ' ':\n return some_str.upper()[::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":12504,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:11:17","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26620,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:11:17","func_code":"def weird_case(some_str):\n s1 = some_str[1::3].lower()\n s2 = some_str[0::2].upper()\n s3 = s1 + s2\n return s3","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27471,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:11:17","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if '0' in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":30420,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:11:29","func_code":"def weird_case(some_str):\n s1 = some_str[1::3].lower()\n s2 = some_str[0::2].upper()\n s3 = s1 + s2\n return s3","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38707,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:11:29","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23165,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:11:29","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":19444,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:11:32","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str.upper()\n else:\n new_str = new_str + some_str.lower()\n i = i + 1\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18770,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:11:32","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":41730,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:11:32","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13605,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:11:38","func_code":"def weird_case(some_str):\n i = 0\n new_str = ''\n while i < len(some_str):\n some_str = some_str[i].split()\n new_str = some_str[i].upper()\n i += 2\n return new_str[0::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8959,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:11:38","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2255,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:11:42","func_code":"def weird_case(some_str):\n if some_str != ' ':\n return some_str.upper()[::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":9308,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:11:42","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":26035,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:11:42","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8773,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:11:50","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12110,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:11:50","func_code":"def weird_case(some_str):\n i = 0\n new_str = ''\n while i < len(some_str):\n some_str = some_str[i].split()\n new_str = some_str[i].upper()\n i += 2\n return new_str[0::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13217,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:11:51","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":16111,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:11:51","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41075,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:11:51","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str.upper()\n else:\n new_str = new_str + some_str.lower()\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40934,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:12:25","func_code":"def weird_case(some_str):\n i = 0\n new_str = ''\n while i < len(some_str):\n some_str = some_str[i].split()\n new_str = some_str[i::2].upper()\n i += 2\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2203,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:12:25","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":29398,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:12:38","func_code":"def weird_case(some_str):\n i = 0\n new_str = ''\n while i < len(some_str):\n some_str = some_str[i].split()\n new_str = some_str[i::2]\n i += 2\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1401,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:12:38","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18773,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:12:45","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str[i].upper()\n else:\n new_str = new_str + some_str[i].lower()\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":12095,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:12:45","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27918,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:12:45","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":28351,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:12:51","func_code":"def weird_case(some_str):\n i = 0\n new_str = ''\n while i < len(some_str):\n some_str = some_str[i].split()\n new_str = some_str[i].upper()\n i += 2\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4129,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:12:51","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4897,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:12:57","func_code":"def weird_case(some_str):\n new_str = some_str.lower()\n return new_str.upper[0::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19923,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:12:57","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6973,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:12:57","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":6212,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:13:02","func_code":"def weird_case(some_str):\n i = 0\n new_str = ''\n while i < len(some_str):\n some_str = some_str[i].split()\n new_str = some_str[i].upper()\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":5492,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:13:02","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":19793,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:13:32","func_code":"def weird_case(some_str):\n new_str = some_str.lower()\n return new_str.upper()","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1075,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:13:32","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3352,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:13:32","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21008,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:13:54","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":27474,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:13:54","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":19815,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:13:54","func_code":"def weird_case(some_str):\n new_str = some_str.lower()\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6979,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:14:16","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n while i < len(some_str):\n if some_str[i]:\n if i == 0 or i % 2 == 0:\n new_str = new_str + some_str[i].upper()\n else:\n new_str = new_str + some_str[i].lower()\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22336,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:14:16","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":10768,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:14:16","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":26618,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:16:04","func_code":"def weird_case(some_str):\n return 'ChAnGe ThE cAsE'","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2765,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:16:04","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":12300,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:16:04","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":21510,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:16:17","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":27250,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:16:17","func_code":"def weird_case(some_str):\n i = 0\n string2 = ''\n while i < len(some_str):\n some_str = some_str[i].split()\n string2 = some_str[i].upper()\n i += 1\n return string2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20849,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:17:08","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28126,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:17:08","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":900,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:19:43","func_code":"def weird_case(some_str):\n new_str = ' '\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8818,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:19:43","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22670,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:19:57","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":34120,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:19:57","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36513,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:20:35","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":5140,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:20:35","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14244,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:20:40","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":9481,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:21:04","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":19811,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:21:04","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4519,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:21:04","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33479,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:21:04","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22054,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:21:04","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17241,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:21:04","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":26987,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:21:04","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20032,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:21:04","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":931,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-02-21 14:21:04","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4294,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:07","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str = new_str + some_str[i].upper()\n else:\n new_str = new_str + some_str[i].lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14837,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:07","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24091,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:07","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2196,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:36","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str = new_str + letter.upper()\n else:\n new_str = new_str + letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":9057,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:36","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":18409,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:36","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":10482,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:36","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10496,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:36","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str = new_str + letter.upper()\n else:\n new_str = new_str + letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14950,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:36","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":705,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:36","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36162,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:36","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":2788,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-02-21 14:21:36","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str = new_str + letter.upper()\n else:\n new_str = new_str + letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8063,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:22:20","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8844,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:22:20","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":35051,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:22:20","func_code":"def weird_case(some_str):\n new_str = ' '\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":42129,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:22:23","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":4675,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:22:23","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22571,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:22:23","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":31910,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:22:23","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36954,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:22:23","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":7536,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:22:23","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":31954,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:22:23","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9244,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:22:23","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":12011,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-02-21 14:22:23","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22686,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:22:27","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":30999,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:22:27","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":7504,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:22:27","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15486,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:22:27","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":16608,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:22:27","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15362,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:22:27","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":15171,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:22:27","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35350,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:22:27","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":37643,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-02-21 14:22:27","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":5310,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:22:34","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":20147,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:22:34","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25149,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:22:34","func_code":"def weird_case(some_str):\n new = ' '\n i = True\n for letter in some_str:\n if i:\n new += letter.upper()\n else:\n new += letter.lower()\n if letter != ' ':\n i = not i\n return new","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":17539,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:22:50","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":34863,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:07","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":3745,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:07","func_code":"def weird_case(some_str):\n new = ''\n i = True\n for letter in some_str:\n if i:\n new += letter.upper()\n else:\n new += letter.lower()\n if letter != ' ':\n i = not i\n return new","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3630,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:07","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9211,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:20","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12799,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:20","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":22058,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:20","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21580,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:29","func_code":"def weird_case(some_str):\n new = ''\n i = True\n for letter in some_str:\n if i:\n new += letter.upper()\n else:\n new += letter.lower()\n if letter != ' ':\n i = not i\n return new","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35517,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:29","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41664,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:29","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10089,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:29","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33101,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:29","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":32556,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:29","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":798,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:29","func_code":"def merge_lists(l1, l2):\n l3 = l1[0::2] + l2[0::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27031,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:29","func_code":"def weird_case(some_str):\n new = ''\n i = True\n for letter in some_str:\n if i:\n new += letter.upper()\n else:\n new += letter.lower()\n if letter != ' ':\n i = not i\n return new","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":587,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-02-21 14:23:29","func_code":"def weird_case(some_str):\n new = ''\n i = True\n for letter in some_str:\n if i:\n new += letter.upper()\n else:\n new += letter.lower()\n if letter != ' ':\n i = not i\n return new","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32457,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:38","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24149,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:38","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6146,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:38","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3523,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:38","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9163,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:38","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":36058,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:38","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":7557,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:38","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":350,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:38","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26781,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-02-21 14:23:38","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":42062,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:31:46","func_code":"def merge_lists(l1, l2):\n for num in l1:\n l2.append(num)\n l3 = sorted(l2)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":4095,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:34:51","func_code":"def merge_lists(l1, l2):\n for num in l1:\n l3.append(num)\n for number in l2:\n l3.append(number)\n sorted(l)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":18661,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:35:06","func_code":"def merge_lists(l1, l2):\n for num in l1:\n l3.append(num)\n for number in l2:\n l3.append(number)\n sorted(l3)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":23034,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:41:23","func_code":"def merge_lists(l1, l2):\n l3 = l1.append(l2)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":12370,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:48:12","func_code":"def merge_lists(l1, l2):\n l3 = []\n for i in l1:\n l3 = l3 + [i[::l2]]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":721,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:50:43","func_code":"def merge_lists(l1, l2):\n l3 = l1[0:2] + l2[0:2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":41654,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:51:27","func_code":"def merge_lists(l1, l2):\n l3 = l1[0:2] + l2[0:2]\n return l3[0:2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":24524,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:51:59","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15841,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:52:17","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36482,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:52:17","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6046,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-02-21 14:52:17","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7693,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:33:13","func_code":"def remove_zeros(List):\n i = 0\n while 0 in List:\n List.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23218,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:33:13","func_code":"def merge_lists(l1, l2):\n l3 = []\n flip = 1\n for num in l1:\n if flip > 0:\n l3.append(num)\n flip = -flip\n flip = 1\n for num in l2:\n if flip > 0:\n l3.append(num)\n flip = -flip\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2363,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:33:13","func_code":"def weird_case(some_str):\n some_str = list(some_str)\n i = 0\n while i != len(some_str):\n while i % 2 == 1:\n some_str[i] = some_str[i].upper()\n i = i + 1\n return ''.join(some_str)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11520,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:34:45","func_code":"def remove_zeros(List):\n i = 0\n while 0 in List:\n List.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":28084,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:34:45","func_code":"def weird_case(some_str):\n some_str = list(some_str)\n i = 0\n while i != len(some_str):\n while i % 2 == 1:\n some_str[i] = some_str[i].upper()\n i = i + 1\n return ''.join(some_str)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31924,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:34:45","func_code":"def merge_lists(l1, l2):\n l3 = []\n flip = 1\n for num in l1:\n if flip > 0:\n l3.append(num)\n flip = -flip\n flip = 1\n for num in l2:\n if flip > 0:\n l3.append(num)\n flip = -flip\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39933,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:36:14","func_code":"def merge_lists(l1, l2):\n l3 = []\n flip = 1\n for num in l1:\n if flip > 0:\n l3.append(num)\n flip = -flip\n flip = 1\n for num in l2:\n if flip > 0:\n l3.append(num)\n flip = -flip\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30247,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:36:14","func_code":"def remove_zeros(List):\n i = 0\n while 0 in List:\n List.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":34671,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:36:14","func_code":"def weird_case(some_str):\n some_str = list(some_str)\n i = 0\n while i != len(some_str):\n if i % 2 == 1:\n some_str[i] = some_str[i].upper()\n i = i + 1\n return ''.join(some_str)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1786,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:36:51","func_code":"def merge_lists(l1, l2):\n l3 = []\n flip = 1\n for num in l1:\n if flip > 0:\n l3.append(num)\n flip = -flip\n flip = 1\n for num in l2:\n if flip > 0:\n l3.append(num)\n flip = -flip\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23059,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:36:51","func_code":"def remove_zeros(List):\n i = 0\n while 0 in List:\n List.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10003,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:36:51","func_code":"def weird_case(some_str):\n some_str = list(some_str)\n i = 0\n while i != len(some_str):\n if i % 2 == 0:\n some_str[i] = some_str[i].upper()\n i = i + 1\n return ''.join(some_str)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25672,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:51:53","func_code":"def weird_case(some_str):\n words = some_str.split()\n flipper = 1\n SoMe_StR = []\n for word in words:\n word = list(word)\n for letter in word:\n if flipper > 0:\n SoMe_StR.append(letter.upper())\n else:\n SoMe_StR.append(letter)\n flipper = -flipper\n SoMe_StR.append(' ')\n flipper = 1\n return ''.join(SoMe_StR)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3496,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:51:53","func_code":"def remove_zeros(List):\n i = 0\n while 0 in List:\n List.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":2573,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:51:53","func_code":"def merge_lists(l1, l2):\n l3 = []\n flip = 1\n for num in l1:\n if flip > 0:\n l3.append(num)\n flip = -flip\n flip = 1\n for num in l2:\n if flip > 0:\n l3.append(num)\n flip = -flip\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":38173,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:52:34","func_code":"def remove_zeros(List):\n i = 0\n while 0 in List:\n List.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":18338,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:52:34","func_code":"def merge_lists(l1, l2):\n l3 = []\n flip = 1\n for num in l1:\n if flip > 0:\n l3.append(num)\n flip = -flip\n flip = 1\n for num in l2:\n if flip > 0:\n l3.append(num)\n flip = -flip\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37919,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:52:34","func_code":"def weird_case(some_str):\n words = some_str.split()\n flipper = 1\n SoMe_StR = []\n for word in words:\n word = list(word)\n for letter in word:\n if flipper > 0:\n SoMe_StR.append(letter.upper())\n else:\n SoMe_StR.append(letter)\n flipper = -flipper\n SoMe_StR.append(' ')\n flipper = -flipper\n return ''.join(SoMe_StR)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10409,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:52:49","func_code":"def merge_lists(l1, l2):\n l3 = []\n flip = 1\n for num in l1:\n if flip > 0:\n l3.append(num)\n flip = -flip\n flip = 1\n for num in l2:\n if flip > 0:\n l3.append(num)\n flip = -flip\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":32053,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:52:49","func_code":"def remove_zeros(List):\n i = 0\n while 0 in List:\n List.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":11873,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:52:49","func_code":"def weird_case(some_str):\n words = some_str.split()\n flipper = 1\n SoMe_StR = []\n for word in words:\n word = list(word)\n for letter in word:\n if flipper > 0:\n SoMe_StR.append(letter.upper())\n else:\n SoMe_StR.append(letter)\n flipper = -flipper\n SoMe_StR.append(' ')\n flipper = flipper\n return ''.join(SoMe_StR)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13434,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:54:52","func_code":"def merge_lists(l1, l2):\n l3 = []\n flip = 1\n for num in l1:\n if flip > 0:\n l3.append(num)\n flip = -flip\n flip = 1\n for num in l2:\n if flip > 0:\n l3.append(num)\n flip = -flip\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4501,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:54:52","func_code":"def weird_case(some_str):\n words = some_str.split()\n flipper = 1\n SoMe_StR = []\n for word in words:\n word = list(word)\n for letter in word:\n if flipper > 0:\n SoMe_StR.append(letter.upper())\n else:\n SoMe_StR.append(letter)\n flipper = -flipper\n SoMe_StR.append(' ')\n flipper = flipper\n SoMe_StR = ''.join(SoMe_StR[:-1])\n return SoMe_StR","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18503,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:54:52","func_code":"def weird_case(some_str):\n words = some_str.split()\n flipper = 1\n SoMe_StR = []\n for word in words:\n word = list(word)\n for letter in word:\n if flipper > 0:\n SoMe_StR.append(letter.upper())\n else:\n SoMe_StR.append(letter)\n flipper = -flipper\n SoMe_StR.append(' ')\n flipper = flipper\n SoMe_StR = ''.join(SoMe_StR[:-1])\n return SoMe_StR","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24007,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:54:52","func_code":"def remove_zeros(List):\n i = 0\n while 0 in List:\n List.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21048,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:54:52","func_code":"def remove_zeros(List):\n i = 0\n while 0 in List:\n List.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":27486,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:54:52","func_code":"def merge_lists(l1, l2):\n l3 = []\n flip = 1\n for num in l1:\n if flip > 0:\n l3.append(num)\n flip = -flip\n flip = 1\n for num in l2:\n if flip > 0:\n l3.append(num)\n flip = -flip\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39983,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:54:52","func_code":"def weird_case(some_str):\n words = some_str.split()\n flipper = 1\n SoMe_StR = []\n for word in words:\n word = list(word)\n for letter in word:\n if flipper > 0:\n SoMe_StR.append(letter.upper())\n else:\n SoMe_StR.append(letter)\n flipper = -flipper\n SoMe_StR.append(' ')\n flipper = flipper\n SoMe_StR = ''.join(SoMe_StR[:-1])\n return SoMe_StR","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39039,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:54:52","func_code":"def merge_lists(l1, l2):\n l3 = []\n flip = 1\n for num in l1:\n if flip > 0:\n l3.append(num)\n flip = -flip\n flip = 1\n for num in l2:\n if flip > 0:\n l3.append(num)\n flip = -flip\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":42256,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-02-21 15:54:52","func_code":"def remove_zeros(List):\n i = 0\n while 0 in List:\n List.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":17128,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-21 16:46:45","func_code":"def merge_lists(l1, l2):\n merged_list = []\n i = 0\n while i < len(l1):\n merge_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merge_list.append(l2[i])\n i += 2\n return merge_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":5938,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-21 16:47:10","func_code":"def merge_lists(l1, l2):\n merged_list = []\n i = 0\n while i < len(l1):\n merge_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merge_list.append(l2[i])\n i += 2\n print(merge_list)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":4861,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-21 16:47:37","func_code":"def merge_lists(l1, l2):\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n print(merged_list)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":2684,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-21 16:53:25","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n sys.stdout.write(merged_list)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":25294,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-21 16:56:43","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n sys.stdout.write(merged_list)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":36692,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-21 16:57:30","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n print(merged_list)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":7518,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-21 17:04:33","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30404,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-21 17:04:33","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35144,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-21 17:04:33","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3259,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 18:54:20","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n m.remove(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 0 or i == 0:\n m.append(n[i])\n i = i + 1\n return m","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":20689,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 18:54:53","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n m.remove(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 0 or i == 0:\n m.append(n[i])\n i = i + 1\n return n\n return m","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":18037,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 18:55:48","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 0 or i == 0:\n m.append(n[i])\n i = i + 1\n return n\n return m","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15182,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 18:56:09","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 0 or i == 0:\n m.append(n[i])\n i = i + 1\n return m","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":4737,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 18:56:38","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 0 or i == 0:\n m.append(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":28839,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 18:58:05","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31763,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:02:04","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":38015,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:02:04","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n a.append(word[i].lower())\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":9974,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:04:08","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":8822,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:04:08","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x].lower())\n x = x + 1\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37825,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:05:01","func_code":"def weird_case(n):\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n return word[x].lower()\n x = x + 1\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4394,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:05:01","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22362,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:10:30","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":40480,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:10:30","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a)])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24330,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:10:52","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":23107,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:10:52","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8921,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:11:18","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":25834,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:11:18","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15800,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:11:18","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11737,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:11:18","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":28744,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:11:18","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36481,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-21 19:11:18","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22216,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-21 19:43:22","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while i < len(l2):\n a.append(l2[i])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15649,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-21 19:44:31","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[i])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":14546,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-21 19:44:44","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28151,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-21 19:56:20","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3770,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-21 19:56:20","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n tokens = some_str.split()\n i = i + 1\n return tokens","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14381,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-21 19:56:20","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18487,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-21 19:56:20","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n tokens = some_str.split()\n i = i + 1\n return tokens","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36054,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-21 19:56:20","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22412,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-21 19:56:20","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n tokens = some_str.split()\n i = i + 1\n return tokens","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":30758,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 12:50:38","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8973,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 12:54:30","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7948,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 12:54:30","func_code":"def weird_case(string):\n string = input()\n letters = string.split()\n while i < len(letters):\n if i % 2 == 0:\n print(letters[i])\n elif i % 2 != 0:\n print(letter[i].upper)\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":17589,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:21","func_code":"def remove_zeros(list):\n i = 0\n list = input()\n while i < len(list):\n if 0 in list:\n list.pop(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":39054,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:21","func_code":"def weird_case(string):\n i = 0\n print(list(string))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":12050,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:21","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2164,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:38","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14506,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:38","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.pop(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":32097,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:38","func_code":"def weird_case(string):\n i = 0\n print(list(string))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1366,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:38","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":1477,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:38","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.pop(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":33230,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:38","func_code":"def weird_case(string):\n i = 0\n print(list(string))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33255,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:38","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20387,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:38","func_code":"def weird_case(string):\n i = 0\n print(list(string))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19095,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-22 14:13:38","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.pop(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":29119,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:26:02","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key in d:\n new_dict[key[d]] = key\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":31618,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:26:26","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key in d:\n new_dict[d[key]] = key\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":39175,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:29:46","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n dic = {}\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n dic[values[i]] = keys[i]\n i = i + 1\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":28553,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:30:25","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key in d:\n new_dict[d[key]] = key\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":10498,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:30:45","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key in d:\n new_dict[key] = d[key]\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":26546,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:31:13","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key in d:\n new_dict[d[key]] = key\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":26573,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:31:29","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key in d:\n new_dict[d[key]] = key\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":39491,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:31:29","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key in d:\n new_dict[d[key]] = key\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":8627,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:31:33","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n dic = {}\n for v, k in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n dic[values[i]] = keys[i]\n i = i + 1\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":31596,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:31:52","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n dic = {}\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n dic[values[i]] = keys[i]\n i = i + 1\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":24485,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:32:22","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n dic = {}\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n dic[values[i]] = keys[i]\n i = i + 1\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":24398,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:32:32","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n dic = {}\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n dic[values[i]] = keys[i]\n i = i + 1\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":1605,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:32:32","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n dic = {}\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n dic[values[i]] = keys[i]\n i = i + 1\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":12432,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:33:44","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for key in d:\n if d[key] not in new_dict:\n new_dict[d[key]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30609,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:34:39","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for key in d:\n if key not in new_dict:\n new_dict[d[key]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":11131,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:35:28","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n dic = {}\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values) and values[i] not in values:\n dic[values[i]] = keys[i]\n i = i + 1\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":9532,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-02-22 14:35:30","func_code":"def swap_keys_values(d):\n return {p[1]: p[0] for p in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":32766,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-02-22 14:37:10","func_code":"def swap_keys_values(d):\n return {p[1]: p[0] for p in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":22203,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-02-22 14:37:10","func_code":"def swap_keys_values(d):\n return {p[1]: p[0] for p in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":23211,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:38:37","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n dic = {}\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n j = 0\n while j < len(values):\n if values[i] == values[j] and i != j:\n values[i] == '@@'\n j = j + 1\n i = i + 1\n i = 0\n while i < len(values) and values[i] != '@@':\n dic[values[i]] = keys[i]\n i = i + 1\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":20944,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:39:06","func_code":"def swap_unique_keys_values(d):\n A = '@@'\n keys = []\n values = []\n dic = {}\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n j = 0\n while j < len(values):\n if values[i] == values[j] and i != j:\n values[i] == A\n values[j] == A\n j = j + 1\n i = i + 1\n i = 0\n while i < len(values) and values[i] != A:\n dic[values[i]] = keys[i]\n i = i + 1\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":28880,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:43:00","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n dic = {}\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n j = 0\n while j < len(values):\n if values[i] == values[j] and i != j:\n 0\n else:\n new_values.append(values[i])\n j = j + 1\n i = i + 1\n i = 0\n while i < len(values):\n dic[values[i]] = keys[i]\n i = i + 1\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":874,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:43:17","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n dic = {}\n new_values = []\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n j = 0\n while j < len(values):\n if values[i] == values[j] and i != j:\n 0\n else:\n new_values.append(values[i])\n j = j + 1\n i = i + 1\n i = 0\n while i < len(values):\n dic[values[i]] = keys[i]\n i = i + 1\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":38392,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-02-22 14:43:55","func_code":"def swap_keys_values(d):\n newD = {}\n for k, v in list(d.items()):\n newD[v] = k\n return newD","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":13362,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-02-22 14:43:55","func_code":"def swap_keys_values(d):\n newD = {}\n for k, v in list(d.items()):\n newD[v] = k\n return newD","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21515,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:45:46","func_code":"def swap_unique_keys_values(d):\n values = []\n for key in d:\n values.append(key)\n for value in values:\n if count(value) < 2:\n unique_values.append(value)\n for key in d:\n if key in unique_values:\n new_dict[key[unique_values]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":22071,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:46:40","func_code":"def swap_unique_keys_values(d):\n values = []\n for key in d:\n values.append(key)\n for value in values:\n if values.count(value) < 2:\n unique_values.append(value)\n for key in d:\n if key in unique_values:\n new_dict[key[unique_values]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":14056,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:46:56","func_code":"def swap_unique_keys_values(d):\n unique_values = []\n values = []\n for key in d:\n values.append(key)\n for value in values:\n if values.count(value) < 2:\n unique_values.append(value)\n for key in d:\n if key in unique_values:\n new_dict[key[unique_values]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":8069,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:47:22","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n unique_values = []\n values = []\n for key in d:\n values.append(key)\n for value in values:\n if values.count(value) < 2:\n unique_values.append(value)\n for key in d:\n if key in unique_values:\n new_dict[key[unique_values]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35568,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:47:58","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n unique_values = []\n values = []\n for key in d:\n values.append(key)\n for value in values:\n if values.count(value) < 2:\n unique_values.append(value)\n for key in d:\n if key in unique_values:\n new_dict[unique_values[key]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":9026,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:48:54","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n dic = {}\n new_values = []\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n j = 0\n while j < len(values):\n if values[i] == values[j] and i != j:\n 0\n else:\n new_values.append(values[i])\n j = j + 1\n i = i + 1\n i = 0\n while i < len(values):\n dic[new_values[i]] = keys[i]\n i = i + 1\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":11220,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:48:59","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n unique_values = []\n values = []\n for key in d:\n values.append(d[key])\n for value in values:\n if values.count(value) < 2:\n unique_values.append(value)\n for key in d:\n if key in unique_values:\n new_dict[unique_values[key]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":8793,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:49:05","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n dic = {}\n new_values = []\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n j = 0\n while j < len(values):\n if values[i] == values[j] and i != j:\n 0\n else:\n new_values.append(values[i])\n j = j + 1\n i = i + 1\n i = 0\n while i < len(new_values):\n dic[new_values[i]] = keys[i]\n i = i + 1\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":2885,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:49:38","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n unique_values = []\n values = []\n for key in d:\n values.append(d[key])\n for value in values:\n if values.count(value) < 2:\n unique_values.append(value)\n for key in d:\n if d[key] in unique_values:\n new_dict[unique_values[key]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":539,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-02-22 14:49:49","func_code":"def swap_keys_values(d):\n return {a[1]: a[0] for a in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":2210,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-02-22 14:49:49","func_code":"def swap_keys_values(d):\n return {a[1]: a[0] for a in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35879,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:49:50","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n dic = {}\n new_values = []\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n j = 0\n while j < len(values):\n if values[i] == values[j] and i != j:\n 0\n else:\n new_values.append(values[i])\n j = j + 1\n i = i + 1\n i = 0\n while i < len(keys):\n dic[new_values[i]] = keys[i]\n i = i + 1\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30611,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:50:09","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n unique_values = []\n values = []\n for key in d:\n values.append(d[key])\n for value in values:\n if values.count(value) < 2:\n unique_values.append(value)\n for key in d:\n if d[key] in unique_values:\n new_dict[d[key]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":2983,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:50:09","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n unique_values = []\n values = []\n for key in d:\n values.append(d[key])\n for value in values:\n if values.count(value) < 2:\n unique_values.append(value)\n for key in d:\n if d[key] in unique_values:\n new_dict[d[key]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":24167,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-02-22 14:50:09","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n unique_values = []\n values = []\n for key in d:\n values.append(d[key])\n for value in values:\n if values.count(value) < 2:\n unique_values.append(value)\n for key in d:\n if d[key] in unique_values:\n new_dict[d[key]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":34426,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:50:29","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n dic = {}\n new_values = []\n new_keys = []\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n j = 0\n while j < len(values):\n if values[i] == values[j] and i != j:\n 0\n else:\n new_values.append(values[i])\n new_keys.append(keys[i])\n j = j + 1\n i = i + 1\n i = 0\n while i < len(keys):\n dic[new_values[i]] = new_keys[i]\n i = i + 1\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":32888,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:50:52","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n dic = {}\n new_values = []\n new_keys = []\n for k, v in list(d.items()):\n keys.append(k)\n values.append(v)\n i = 0\n while i < len(values):\n j = 0\n while j < len(values):\n if values[i] == values[j] and i != j:\n 0\n else:\n new_values.append(values[i])\n new_keys.append(keys[i])\n j = j + 1\n i = i + 1\n i = 0\n while i < len(new_keys):\n dic[new_values[i]] = new_keys[i]\n i = i + 1\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":7658,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 14:59:23","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n values = []\n dic = {}\n new_values = []\n new_keys = []\n seen = {}\n for k, v in list(d.items()):\n kv.append(v, k)\n seen[kv[t[0]]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if seen[t[0]] == A:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30715,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:00:01","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n values = []\n dic = {}\n new_values = []\n new_keys = []\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[t[0]]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if seen[t[0]] == A:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":8679,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:01:12","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n values = []\n dic = {}\n new_values = []\n new_keys = []\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[0][0]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if seen[t[0]] == A:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35998,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-02-22 15:01:49","func_code":"def swap_keys_values(d):\n new_d = {}\n for key in d:\n new_d[d[key]] = key\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":4052,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-02-22 15:01:49","func_code":"def swap_keys_values(d):\n new_d = {}\n for key in d:\n new_d[d[key]] = key\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14945,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-02-22 15:04:52","func_code":"def swap_keys_values(dick):\n newDick = {}\n for item in dick:\n newDick[dick[item]] = item\n return newDick","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":12362,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-02-22 15:04:52","func_code":"def swap_keys_values(dick):\n newDick = {}\n for item in dick:\n newDick[dick[item]] = item\n return newDick","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35450,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-02-22 15:05:37","func_code":"def swap_keys_values(my_dict):\n swapped_dict = {}\n dict_items = sorted(my_dict.items())\n for i in dict_items:\n key, value = i[0], i[1]\n swapped_dict[value] = key\n return swapped_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":3689,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-02-22 15:05:37","func_code":"def swap_keys_values(my_dict):\n swapped_dict = {}\n dict_items = sorted(my_dict.items())\n for i in dict_items:\n key, value = i[0], i[1]\n swapped_dict[value] = key\n return swapped_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":36432,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:06:59","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n dic = {}\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[0][0]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if seen[t[0]] == A:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":22305,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-02-22 15:07:36","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for key in d:\n if d[key] not in new_d:\n new_d[d[key]] = key\n else:\n del new_d[key]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18532,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:07:50","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n values = []\n dic = {}\n new_values = []\n new_keys = []\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[0][0]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if seen[t[0]] == A:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":34505,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:09:01","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n values = []\n dic = {}\n new_values = []\n new_keys = []\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[0][0]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if not seen[t[0]]:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18572,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-02-22 15:09:48","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for key in d:\n if d[key] not in new_d:\n new_d[d[key]] = key\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":8360,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:10:23","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n dic = {}\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[0][0]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if not seen[t[0]]:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":13751,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-02-22 15:12:39","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for key in d:\n if d[key] not in new_d:\n new_d[d[key]] = key\n else:\n del new_d[key]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":17098,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-02-22 15:13:04","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for key in d:\n if d[key] not in new_d:\n new_d[d[key]] = key\n else:\n del new_d[d[key]]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":37715,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-02-22 15:13:04","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for key in d:\n if d[key] not in new_d:\n new_d[d[key]] = key\n else:\n del new_d[d[key]]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":18849,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-02-22 15:13:04","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for key in d:\n if d[key] not in new_d:\n new_d[d[key]] = key\n else:\n del new_d[d[key]]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":28855,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:14:09","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n dic = {}\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[0][0]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if not seen[t[0]]:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":2537,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:15:07","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n dic = {}\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[0][0]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if not seen[t[0]]:\n dic[t[0]] = t[1]\n return sorted(dic)","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":31397,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:15:55","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n dic = {}\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[0][0]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if not seen[t[0]]:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":7222,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:16:06","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n dic = {}\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[0][0]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if not seen[t[0]]:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":3417,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:16:06","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n dic = {}\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[0][0]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if not seen[t[0]]:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6025,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-02-22 15:16:06","func_code":"def swap_unique_keys_values(d):\n A = False\n kv = []\n dic = {}\n seen = {}\n for k, v in list(d.items()):\n kv.append((v, k))\n seen[kv[0][0]] = A\n for t in kv:\n if t[0] not in seen:\n seen[t[0]] = A\n else:\n seen[t[0]] = True\n for t in kv:\n if not seen[t[0]]:\n dic[t[0]] = t[1]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":24089,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:16:24","func_code":"def swap_keys_values(dic):\n a, b, c = [], [], {}\n for file in dict:\n a.append(file)\n for letter in a:\n c[dic[letter]] = letter\n return c","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":21712,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:16:46","func_code":"def swap_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append(file)\n for letter in a:\n c[dic[letter]] = letter\n return c","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":8795,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-02-22 15:20:06","func_code":"def swap_keys_values(d):\n q = {}\n for key in d:\n value = d[key]\n q[value] = key\n return q","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":17045,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-02-22 15:20:06","func_code":"def swap_keys_values(d):\n q = {}\n for key in d:\n value = d[key]\n q[value] = key\n return q","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":25833,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:21:11","func_code":"def swap_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append(file)\n for letter in a:\n c[dic[letter]] = letter\n return c","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":41498,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:21:11","func_code":"def swap_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append(file)\n for letter in a:\n c[dic[letter]] = letter\n return c","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":4760,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:21:52","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append(file)\n for letter in a:\n if letter not in c:\n c[dic[letter]] = letter\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":37600,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-02-22 15:21:55","func_code":"def swap_unique_keys_values(my_dict):\n unique_dict = {}\n for k, v in list(my_dict.items()):\n if v in unique_dict:\n del unique_dict[v]\n else:\n unique_dict[v] = k\n return unique_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":34596,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-02-22 15:21:55","func_code":"def swap_unique_keys_values(my_dict):\n unique_dict = {}\n for k, v in list(my_dict.items()):\n if v in unique_dict:\n del unique_dict[v]\n else:\n unique_dict[v] = k\n return unique_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":3078,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-02-22 15:23:53","func_code":"def swap_keys_values(d):\n opposite = {}\n for k in d:\n opposite[d[k]] = k\n return opposite","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":22034,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-02-22 15:23:53","func_code":"def swap_keys_values(d):\n opposite = {}\n for k in d:\n opposite[d[k]] = k\n return opposite","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":30704,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:25:13","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n if file in a:\n a.pop(a.index(file))\n else:\n a.append(file)\n for letter in a:\n if letter not in c:\n c[dic[letter]] = letter\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":20917,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:25:36","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n if file in a:\n print(a.index(file))\n a.pop(a.index(file))\n else:\n a.append(file)\n for letter in a:\n if letter not in c:\n c[dic[letter]] = letter\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":5991,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-02-22 15:26:37","func_code":"def swap_keys_values(d):\n return {p[0]: p[1] for p in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":36273,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-02-22 15:26:52","func_code":"def swap_keys_values(d):\n return {p[1]: p[0] for p in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":36827,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-02-22 15:26:52","func_code":"def swap_keys_values(d):\n return {p[1]: p[0] for p in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":1325,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-02-22 15:26:52","func_code":"def swap_keys_values(d):\n return {p[1]: p[0] for p in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18807,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:27:39","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n if file in a:\n a.pop(a.index(file))\n else:\n a.append(file)\n for letter in a:\n if letter not in c:\n c[dic[letter]] = letter\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":37989,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:27:56","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n if file in a:\n a.pop(a.index(file))\n else:\n a.append(file)\n for letter in a:\n c[dic[letter]] = letter\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":10688,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 15:29:46","func_code":"def swap_keys_values(dic):\n d = []\n for key in dic:\n value = d[key]\n d[value] = key\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":27794,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-02-22 15:30:19","func_code":"def swap_unique_keys_values(d):\n q = {}\n a = []\n for key in d:\n value = d[key]\n if value not in a:\n q[value] = key\n a.append(value)\n return q","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":11362,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 15:30:51","func_code":"def swap_keys_values(dic):\n d = []\n for key in dic:\n value = dic[key]\n d[value] = key\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":9288,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-02-22 15:31:02","func_code":"def swap_keys_values(d):\n dic = {}\n a = list(d.values())\n b = list(d.keys())\n for i in range(0, len(a)):\n dic[a[i]] = b[i]\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35848,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-02-22 15:31:04","func_code":"def swap_unique_keys_values(d):\n q = {}\n a = []\n for key in d:\n value = d[key]\n if value not in a:\n q[value] = key\n a.append(value)\n print(a)\n return q","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":40049,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-02-22 15:31:28","func_code":"def swap_keys_values(d):\n dic = {}\n a = list(d.values())\n b = list(d.keys())\n print(a)","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":3503,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-22 15:31:42","func_code":"def swap_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n new = {}\n i = 0\n while i < len(keys):\n new[value[i]] = keys[i]\n i = i + 1\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":24583,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-02-22 15:31:43","func_code":"def swap_keys_values(s):\n new_d = {}\n key = sorted(d.keys())\n value = sorted(d.values())\n for i in range(0, len(key) - 1):\n new_d[key[i]] = value[i]\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":32081,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-02-22 15:31:48","func_code":"def swap_unique_keys_values(d):\n opposite = {}\n for k in d:\n if d[k] not in opposite:\n opposite[d[k]] = k\n else:\n del d[k]\n return opposite","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6626,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-02-22 15:31:59","func_code":"def swap_keys_values(d):\n dic = {}\n a = list(d.values())\n b = list(d.keys())\n print((a, 'boop'))","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":41568,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 15:32:08","func_code":"def swap_keys_values(d):\n q = []\n for key in d:\n value = d[key]\n q[value] = key\n return q","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":11974,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-02-22 15:32:33","func_code":"def swap_keys_values(d):\n new_d = {}\n key = sorted(d.keys())\n value = sorted(d.values())\n for i in range(0, len(key) - 1):\n new_d[key[i]] = value[i]\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":12995,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-02-22 15:33:30","func_code":"def swap_unique_keys_values(d):\n return {t[1]: t[0] for t in list(d.items()) if list(d.values()).count(d\n [1]) == 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18509,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-02-22 15:33:45","func_code":"def swap_unique_keys_values(d):\n return {t[1]: t[0] for t in list(d.items()) if list(d.values()).count(d\n [1]) == 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":8585,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-02-22 15:33:46","func_code":"def swap_keys_values(d):\n new_d = {}\n key = sorted(d.keys())\n value = sorted(d.values())\n for i in range(0, len(key)):\n new_d[value[i]] = key[i]\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":28016,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-02-22 15:33:51","func_code":"def swap_keys_values(d):\n e = {}\n for d_tup in list(d.items()):\n e[d_tup[1]] = d_tup[0]\n return e","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":32739,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-02-22 15:33:51","func_code":"def swap_keys_values(d):\n e = {}\n for d_tup in list(d.items()):\n e[d_tup[1]] = d_tup[0]\n return e","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":32361,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-02-22 15:34:20","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n dic[d[key]] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":34957,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-02-22 15:34:20","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n dic[d[key]] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18713,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-02-22 15:34:25","func_code":"def swap_unique_keys_values(d):\n opposite = {}\n for k in d:\n if k not in opposite:\n opposite[d[k]] = k\n else:\n del d[k]\n return opposite","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":5034,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-22 15:34:28","func_code":"def swap_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n new = {}\n i = 0\n while i < len(keys):\n val = value[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":35903,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-02-22 15:34:39","func_code":"def swap_unique_keys_values(d):\n return {t[1]: t[0] for t in list(d.items()) if list(d.values()).count(t\n [1]) == 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":3370,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-02-22 15:34:39","func_code":"def swap_unique_keys_values(d):\n return {t[1]: t[0] for t in list(d.items()) if list(d.values()).count(t\n [1]) == 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":37226,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-22 15:34:42","func_code":"def swap_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":26994,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-22 15:34:42","func_code":"def swap_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":37409,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-22 15:34:42","func_code":"def swap_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":10507,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-02-22 15:34:48","func_code":"def swap_unique_keys_values(d):\n q = {}\n a = []\n b = []\n for key in d:\n value = d[key]\n if value not in a:\n a.append(value)\n else:\n b.append(value)\n for key in d:\n value = d[key]\n if value not in b:\n q[value] = key\n a.append(value)\n return q","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":17093,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-02-22 15:34:48","func_code":"def swap_unique_keys_values(d):\n q = {}\n a = []\n b = []\n for key in d:\n value = d[key]\n if value not in a:\n a.append(value)\n else:\n b.append(value)\n for key in d:\n value = d[key]\n if value not in b:\n q[value] = key\n a.append(value)\n return q","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":24529,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 15:34:54","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":15736,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-02-22 15:35:12","func_code":"def swap_unique_keys_values(d):\n opposite = {}\n for k in d:\n if k not in opposite:\n opposite[d[k]] = k\n else:\n del opposite[k]\n return opposite","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":41685,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-02-22 15:35:41","func_code":"def swap_unique_keys_values(d):\n opposite = {}\n for k in d:\n if k not in opposite:\n opposite[d[k]] = k\n elif k in opposite:\n del opposite[k]\n return opposite","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":4677,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-02-22 15:38:56","func_code":"def swap_unique_keys_values(dick):\n newDick = {}\n deleted = []\n for item in dick:\n if dick[item] not in newDick:\n newDick[dick[item]] = item\n else:\n deleted.append(dick[item])\n print(deleted)","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":709,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-02-22 15:39:34","func_code":"def swap_keys_values(in_dict):\n out_dict = {}\n for k, v in list(in_dict.items()):\n out_dict[v] = k\n return out_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":31702,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-02-22 15:39:41","func_code":"def swap_keys_values():\n new_dict = {}\n for key in d:\n new_dict[d[key]] = key\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":6362,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-02-22 15:39:55","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key in d:\n new_dict[d[key]] = key\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14166,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-02-22 15:39:55","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key in d:\n new_dict[d[key]] = key\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":2070,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-02-22 15:40:25","func_code":"def swap_unique_keys_values(dick):\n newDick = {}\n deleted = []\n for item in dick:\n if dick[item] not in newDick:\n newDick[dick[item]] = item\n else:\n deleted.append(dick[item])\n print(deleted)\n for item in deleted:\n del newDick[item]","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18443,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-02-22 15:41:01","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":23347,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-02-22 15:41:01","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":16725,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-02-22 15:42:48","func_code":"def swap_keys_values(dict_in):\n new_dict = {}\n for k, v in list(dict_in.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":20641,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-02-22 15:42:48","func_code":"def swap_keys_values(dict_in):\n new_dict = {}\n for k, v in list(dict_in.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":36718,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-02-22 15:42:55","func_code":"def swap_unique_keys_values(d):\n e = {}\n for d_tup in list(d.items()):\n if d.values.count(d_tup[1]) == 1:\n e[d_tup[1]] = d_tup[0]\n return e","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":2672,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-02-22 15:43:20","func_code":"def swap_unique_keys_values(d):\n e = {}\n for d_tup in list(d.items()):\n if list(d.values()).count(d_tup[1]) == 1:\n e[d_tup[1]] = d_tup[0]\n return e","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":22974,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-02-22 15:43:28","func_code":"def swap_unique_keys_values(dick):\n newDick = {}\n deleted = []\n for item in dick:\n if dick[item] not in newDick:\n newDick[dick[item]] = item\n else:\n deleted.append(dick[item])\n for item in deleted:\n del newDick[item]","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":34345,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-02-22 15:43:50","func_code":"def swap_unique_keys_values(dick):\n newDick = {}\n deleted = []\n for item in dick:\n if dick[item] not in newDick:\n newDick[dick[item]] = item\n else:\n deleted.append(dick[item])\n for item in deleted:\n del newDick[item]\n print(newDick)","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":8775,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-02-22 15:44:05","func_code":"def swap_unique_keys_values(d):\n e = {}\n for d_tup in list(d.items()):\n if list(d.values()).count(d_tup[1]) == 1:\n e[d_tup[1]] = d_tup[0]\n return e","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":27192,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-02-22 15:44:05","func_code":"def swap_unique_keys_values(d):\n e = {}\n for d_tup in list(d.items()):\n if list(d.values()).count(d_tup[1]) == 1:\n e[d_tup[1]] = d_tup[0]\n return e","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":33181,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-02-22 15:44:05","func_code":"def swap_unique_keys_values(d):\n e = {}\n for d_tup in list(d.items()):\n if list(d.values()).count(d_tup[1]) == 1:\n e[d_tup[1]] = d_tup[0]\n return e","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":37936,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:44:12","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n if file in a:\n a.pop(a.index(dic[file]))\n else:\n a.append([file, dic[file]])\n print(a)\n for letter in a:\n print(letter)\n if letter[1] in c:\n del c[letter[1]]\n else:\n c[letter[1]] = letter[0]\n print(c)\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":41062,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-02-22 15:44:19","func_code":"def swap_unique_keys_values(dick):\n newDick = {}\n deleted = []\n for item in dick:\n if dick[item] not in newDick:\n newDick[dick[item]] = item\n else:\n deleted.append(dick[item])\n for item in deleted:\n del newDick[item]\n return newDick","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":38430,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-02-22 15:44:19","func_code":"def swap_unique_keys_values(dick):\n newDick = {}\n deleted = []\n for item in dick:\n if dick[item] not in newDick:\n newDick[dick[item]] = item\n else:\n deleted.append(dick[item])\n for item in deleted:\n del newDick[item]\n return newDick","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":21328,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:44:21","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n if file in a:\n a.pop(a.index(dic[file]))\n else:\n a.append([file, dic[file]])\n for letter in a:\n print(letter)\n if letter[1] in c:\n del c[letter[1]]\n else:\n c[letter[1]] = letter[0]\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":42465,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:44:29","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n if file in a:\n a.pop(a.index(dic[file]))\n else:\n a.append([file, dic[file]])\n for letter in a:\n if letter[1] in c:\n del c[letter[1]]\n else:\n c[letter[1]] = letter[0]\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":21619,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:44:52","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append([file, dic[file]])\n for letter in a:\n if letter[1] in c:\n del c[letter[1]]\n else:\n c[letter[1]] = letter[0]\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":17626,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:44:52","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append([file, dic[file]])\n for letter in a:\n if letter[1] in c:\n del c[letter[1]]\n else:\n c[letter[1]] = letter[0]\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":10762,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-02-22 15:44:52","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append([file, dic[file]])\n for letter in a:\n if letter[1] in c:\n del c[letter[1]]\n else:\n c[letter[1]] = letter[0]\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":33423,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-02-22 15:45:13","func_code":"def swap_keys_values(d):\n new_dict = {}\n old = sorted(d.items())\n for pair in old:\n new_dict[pair[1]] = pair[0]\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":33565,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-02-22 15:45:13","func_code":"def swap_keys_values(d):\n new_dict = {}\n old = sorted(d.items())\n for pair in old:\n new_dict[pair[1]] = pair[0]\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":19427,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-02-22 15:45:39","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for key in d:\n if d[key] not in new_dict:\n new_dict[d[key]] = key\n else:\n del new_dict[d[key]]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":13782,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-02-22 15:45:39","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for key in d:\n if d[key] not in new_dict:\n new_dict[d[key]] = key\n else:\n del new_dict[d[key]]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":17253,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-02-22 15:45:39","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for key in d:\n if d[key] not in new_dict:\n new_dict[d[key]] = key\n else:\n del new_dict[d[key]]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":34337,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-02-22 15:48:54","func_code":"def swap_unique_keys_values(in_dict):\n dict_out = {}\n not_unique = set()\n for k, v in list(in_dict.items()):\n if v in dict_out:\n not_unique.update([v])\n del dict_out[v]\n elif v not in not_unique:\n dict_out[v] = k\n return dict_out","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":16932,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-02-22 15:49:11","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n old = sorted(d.items())\n for pair in old:\n if pair[1] not in new_dict:\n new_dict[pair[1]] = pair[0]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":72,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-02-22 15:51:50","func_code":"def swap_unique_keys_values(d):\n unique = []\n for k in d:\n if d[k] not in unique:\n unique.append(d[k])\n elif d[k] in unique:\n unique.remove(d[k])\n opposite = {}\n for k in d:\n if k in unique:\n opposite[d[k]] = k\n return opposite","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6202,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-02-22 15:52:03","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":12793,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-02-22 15:52:36","func_code":"def swap_unique_keys_values(d):\n unique = []\n for k in d:\n if d[k] not in unique:\n unique.append(d[k])\n elif d[k] in unique:\n unique.remove(d[k])\n opposite = {}\n for k in d:\n if d[k] in unique:\n opposite[d[k]] = k\n return opposite","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":10926,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-02-22 15:52:36","func_code":"def swap_unique_keys_values(d):\n unique = []\n for k in d:\n if d[k] not in unique:\n unique.append(d[k])\n elif d[k] in unique:\n unique.remove(d[k])\n opposite = {}\n for k in d:\n if d[k] in unique:\n opposite[d[k]] = k\n return opposite","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":11566,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-02-22 15:53:17","func_code":"def swap_keys_values(dictionary):\n new_dictionary = {}\n for key in dictionary:\n new_dictionary[dictionary[key]] = key\n return new_dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":36917,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-02-22 15:53:17","func_code":"def swap_keys_values(dictionary):\n new_dictionary = {}\n for key in dictionary:\n new_dictionary[dictionary[key]] = key\n return new_dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21146,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-02-22 15:53:17","func_code":"def swap_keys_values(dictionary):\n new_dictionary = {}\n for key in dictionary:\n new_dictionary[dictionary[key]] = key\n return new_dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":9547,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-02-22 15:54:00","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n unique = set()\n for k, v in list(d.items()):\n if v in new_d:\n unique.update([v])\n del new_d[v]\n else:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":15674,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-02-22 15:54:00","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n unique = set()\n for k, v in list(d.items()):\n if v in new_d:\n unique.update([v])\n del new_d[v]\n else:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":25556,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-02-22 15:54:32","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n old = sorted(d.items())\n for pair in old:\n if pair[1] not in new_dict:\n new_dict[pair[1]] = pair[0]\n else:\n del new_dict[pair[1]]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":19514,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-02-22 15:54:32","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n old = sorted(d.items())\n for pair in old:\n if pair[1] not in new_dict:\n new_dict[pair[1]] = pair[0]\n else:\n del new_dict[pair[1]]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":18618,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-02-22 15:54:32","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n old = sorted(d.items())\n for pair in old:\n if pair[1] not in new_dict:\n new_dict[pair[1]] = pair[0]\n else:\n del new_dict[pair[1]]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":39578,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-02-22 15:55:21","func_code":"def swap_unique_keys_values(in_dict):\n dict_out = {}\n not_unique = set()\n for k, v in list(in_dict.items()):\n if v in dict_out:\n not_unique.update([v])\n del dict_out[v]\n else:\n dict_out[v] = k\n return dict_out","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":29195,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2018-02-22 16:03:21","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":5926,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2018-02-22 16:03:21","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":32201,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2018-02-22 16:04:13","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":26636,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2018-02-22 16:04:13","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6955,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2018-02-22 16:04:13","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":816,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-02-22 16:08:40","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n newD = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n newD[keys[i]] = values[i]\n return newD","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":39654,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-02-22 16:09:10","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n newD = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n newD[values[i]] = keys[i]\n return newD","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":38903,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-02-22 16:09:10","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n newD = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n newD[values[i]] = keys[i]\n return newD","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":41826,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-02-22 16:09:10","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n newD = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n newD[values[i]] = keys[i]\n return newD","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":1504,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 16:17:59","func_code":"def swap_keys_values():\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":39286,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 16:18:16","func_code":"def swap_keys_values():\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n print(newd)","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":4900,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 16:18:29","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n print(newd)","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":32287,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 16:26:18","func_code":"def swap_keys_values():\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n print(list(newd.items()))","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":5863,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 16:26:34","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n print(list(newd.items()))","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":35784,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 16:36:09","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n sort = sorted(list(newd.items()), key=lambda x: x[1])\n print(sort)","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":7452,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 16:36:33","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n sort = sorted(list(newd.items()), key=lambda x: x[1])\n print(sort)","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":24640,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 16:37:39","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n sort = sorted(list(newd.items()), key=lambda x: x[1])\n return sort","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":23943,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-02-22 16:47:17","func_code":"def swap_unique_keys_values(d):\n dic = {}\n values = []\n notunique = []\n for key in d:\n if d[key] in values:\n notunique.append(d[key])\n else:\n values.append(d[key])\n for key in d:\n if not d[key] in notunique:\n dic[d[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":20807,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-02-22 16:47:17","func_code":"def swap_unique_keys_values(d):\n dic = {}\n values = []\n notunique = []\n for key in d:\n if d[key] in values:\n notunique.append(d[key])\n else:\n values.append(d[key])\n for key in d:\n if not d[key] in notunique:\n dic[d[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":25085,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-02-22 16:47:17","func_code":"def swap_unique_keys_values(d):\n dic = {}\n values = []\n notunique = []\n for key in d:\n if d[key] in values:\n notunique.append(d[key])\n else:\n values.append(d[key])\n for key in d:\n if not d[key] in notunique:\n dic[d[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":41800,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-02-22 16:51:23","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in zip(d):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":13442,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-02-22 16:52:34","func_code":"def swap_unique_keys_values(in_dict):\n dict_out = {}\n not_unique = set()\n for k, v in list(in_dict.items()):\n if v in dict_out:\n not_unique.update([v])\n del dict_out[v]\n else:\n dict_out[v] = k\n return dict_out","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":21388,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-02-22 16:52:34","func_code":"def swap_unique_keys_values(in_dict):\n dict_out = {}\n not_unique = set()\n for k, v in list(in_dict.items()):\n if v in dict_out:\n not_unique.update([v])\n del dict_out[v]\n else:\n dict_out[v] = k\n return dict_out","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":1667,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-02-22 16:53:26","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14502,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-02-22 16:53:26","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":23492,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-02-22 16:53:26","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":12720,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 17:14:47","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n newd = sorted(list(newd.items()), key=lambda x: x[1])\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":25663,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 17:15:08","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":29073,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 17:15:45","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":42288,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 17:15:45","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":22979,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-22 17:15:45","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n newd = {}\n for word in d:\n keys.append(word)\n for word in d:\n values.append(d[word])\n for i in range(0, len(values)):\n newd[values[i]] = keys[i]\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":1053,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-02-22 17:15:47","func_code":"def swap_keys_values(d):\n swappedDict = {}\n for i in d:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":20241,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-02-22 17:15:47","func_code":"def swap_keys_values(d):\n swappedDict = {}\n for i in d:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":11262,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 17:20:55","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n new_dic = {}\n for key in dic:\n if key not in new_dic:\n new_dic[key] = key\n return new_dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":7941,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 17:20:55","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n new_dic = {}\n for key in dic:\n if key not in new_dic:\n new_dic[key] = key\n return new_dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":3604,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-02-22 17:21:35","func_code":"def swap_unique_keys_values(d):\n swappedDict = {}\n for i in d:\n if d[i] in swappedDict:\n del swappedDict[d[i]]\n else:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":13865,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-02-22 17:21:35","func_code":"def swap_unique_keys_values(d):\n swappedDict = {}\n for i in d:\n if d[i] in swappedDict:\n del swappedDict[d[i]]\n else:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":16139,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-02-22 17:21:35","func_code":"def swap_unique_keys_values(d):\n swappedDict = {}\n for i in d:\n if d[i] in swappedDict:\n del swappedDict[d[i]]\n else:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":26754,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 17:23:14","func_code":"def swap_unique_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n new_dic = {}\n for key in dic:\n if key not in new_dic:\n new_dic[key] = value\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":39699,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 17:25:13","func_code":"def swap_unique_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n new_dic = {}\n for key in dic:\n new_dic[key] = value\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":26256,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 17:25:59","func_code":"def swap_unique_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n new_dic = {}\n for key in dic:\n new_dic[key] = dic[key]\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":26999,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 17:30:55","func_code":"def swap_unique_keys_values(d):\n val = list(d.values())\n for char in val:\n if count(char) > 1:\n del val[char]\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n new_dic = {}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":762,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 17:31:22","func_code":"def swap_unique_keys_values(d):\n val = list(d.values())\n for char in val:\n if char.count() > 1:\n del val[char]\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n new_dic = {}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":41934,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 17:31:22","func_code":"def swap_unique_keys_values(d):\n val = list(d.values())\n for char in val:\n if char.count() > 1:\n del val[char]\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n new_dic = {}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-22 17:31:22","func_code":"def swap_unique_keys_values(d):\n val = list(d.values())\n for char in val:\n if char.count() > 1:\n del val[char]\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n new_dic = {}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18678,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-22 18:44:28","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in d:\n d1[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":16116,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-22 18:46:02","func_code":"def swap_keys_values(d):\n new_d = {}\n for k in d:\n d1[d[k]] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":27082,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-22 18:46:18","func_code":"def swap_keys_values(d):\n new_d = {}\n for k in d:\n new_d[d[k]] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":37303,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-22 18:46:18","func_code":"def swap_keys_values(d):\n new_d = {}\n for k in d:\n new_d[d[k]] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":15387,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-22 18:55:47","func_code":"def swap_unique_keys_values(d):\n l = []\n new_d = {}\n for k in d:\n if d[k] not in l:\n new_d[d[k]] = k\n l.append(d[k])\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18884,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-22 18:55:47","func_code":"def swap_unique_keys_values(d):\n l = []\n new_d = {}\n for k in d:\n if d[k] not in l:\n new_d[d[k]] = k\n l.append(d[k])\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18373,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-22 19:12:49","func_code":"def merge_lists(l1, l2):\n i = 1\n while i < len(l1):\n del l1[i]\n i = i + 1\n i = 1\n while i < len(l2):\n del l2[i]\n i = i + 1\n print(l1 + l2)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":13420,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-22 19:14:38","func_code":"def merge_lists(l1, l2):\n i = 1\n while i < len(l1):\n del l1[i]\n i = i + 1\n j = 1\n while i < len(l2):\n del l2[j]\n j = j + 1\n return l1 + l2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":34230,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-22 19:16:33","func_code":"def merge_lists(l1, l2):\n i = 1\n while i < len(l1):\n del l1[i]\n i = i + 1\n i = 1\n while i < len(l2):\n del l2[i]\n i = i + 1\n print(l1 + l2)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33827,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-22 19:30:30","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l4.append(l2[j])\n j = j + 2\n print(l3 + l4)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":26051,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-22 19:31:15","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l1):\n l1.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l2.append(l2[j])\n j = j + 2\n print(l1 + l2)","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":23256,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-22 19:42:35","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n a = []\n i = 0\n while i < len(l3):\n a.append(l3[i])\n i = i + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4185,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-22 19:46:27","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20570,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-22 19:46:27","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14974,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-22 19:46:27","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2039,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-22 19:57:08","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37596,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-22 19:57:08","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":10534,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-22 19:57:08","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":38157,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-02-22 21:00:53","func_code":"def swap_keys_values(d):\n pairs = list(d.items())\n new_d = {}\n for key, value in pairs:\n new_d[value] = key\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35245,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-02-22 21:00:53","func_code":"def swap_keys_values(d):\n pairs = list(d.items())\n new_d = {}\n for key, value in pairs:\n new_d[value] = key\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":10971,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-02-22 21:00:53","func_code":"def swap_keys_values(d):\n pairs = list(d.items())\n new_d = {}\n for key, value in pairs:\n new_d[value] = key\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":28567,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-02-23 00:50:49","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":37480,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-02-23 00:50:49","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":40956,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-02-23 00:56:19","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if list(d.values()).count(v) == 1:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":27226,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-02-23 01:01:07","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if list(d.values()).count(v) == 1:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":19329,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-02-23 01:01:07","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if list(d.values()).count(v) == 1:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35363,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-02-23 10:23:41","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in (list(d.keys()), list(d.values())):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":19640,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-02-23 10:25:14","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":28510,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-02-23 10:25:14","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":31664,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-02-23 10:37:31","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n if v not in new_dict:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":1905,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-02-23 10:39:07","func_code":"def swap_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n nd[v] = k\n return nd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":5199,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-02-23 10:39:07","func_code":"def swap_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n nd[v] = k\n return nd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":8843,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-02-23 10:52:23","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n counter = {}\n for v in list(d.values()):\n if v not in counter:\n counter[v] = 0\n counter[v] += 1\n for k, v in list(d.items()):\n if counter[v] < 2:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":30835,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-02-23 10:52:23","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n counter = {}\n for v in list(d.values()):\n if v not in counter:\n counter[v] = 0\n counter[v] += 1\n for k, v in list(d.items()):\n if counter[v] < 2:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":28184,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:15:31","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":8273,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:15:31","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20706,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:15:31","func_code":"def weird_case(some_str):\n new_str = ''\n for value in some_str:\n if value == ' ':\n new_str = new_str + value\n elif value is True:\n new_str = new_str + value.upper()\n else:\n new_str = new_str + value\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8646,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:17:22","func_code":"def weird_case(some_str):\n new_str = ''\n capital = True\n for value in some_str:\n if value == ' ':\n new_str = new_str + value\n elif value is capital:\n new_str = new_str + value.upper()\n else:\n new_str = new_str + value\n capital = not capital\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19849,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:17:22","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":4149,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:17:22","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":29444,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:18:35","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":18322,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:18:35","func_code":"def weird_case(some_str):\n new_str = ''\n capital = True\n for value in some_str:\n if capital:\n new_str = new_str + value.upper()\n else:\n new_str = new_str + value\n if value != ' ':\n capital = not capital\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13390,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:18:35","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":36871,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:18:35","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":2626,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:18:35","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25627,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:18:35","func_code":"def weird_case(some_str):\n new_str = ''\n capital = True\n for value in some_str:\n if capital:\n new_str = new_str + value.upper()\n else:\n new_str = new_str + value\n if value != ' ':\n capital = not capital\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28540,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:18:35","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3975,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:18:35","func_code":"def weird_case(some_str):\n new_str = ''\n capital = True\n for value in some_str:\n if capital:\n new_str = new_str + value.upper()\n else:\n new_str = new_str + value\n if value != ' ':\n capital = not capital\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29387,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-23 12:18:35","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36061,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-02-23 14:46:20","func_code":"def swap_unique_keys_values(d):\n nd = {}\n to_delete = []\n for k, v in list(d.items()):\n if v in nd:\n to_delete.append(v)\n else:\n nd[v] = k\n for k in to_delete:\n del nd[k]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":36601,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-02-23 14:46:20","func_code":"def swap_unique_keys_values(d):\n nd = {}\n to_delete = []\n for k, v in list(d.items()):\n if v in nd:\n to_delete.append(v)\n else:\n nd[v] = k\n for k in to_delete:\n del nd[k]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":13086,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-02-23 14:46:20","func_code":"def swap_unique_keys_values(d):\n nd = {}\n to_delete = []\n for k, v in list(d.items()):\n if v in nd:\n to_delete.append(v)\n else:\n nd[v] = k\n for k in to_delete:\n del nd[k]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":37561,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-23 16:42:06","func_code":"def swap_keys_values(dictionary_descriptor):\n new_dictionary = {}\n for keys, values in dictionary_descriptor:\n new_dictionary[values] = keys","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":36715,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-23 16:42:42","func_code":"def swap_keys_values(dictionary_descriptor):\n new_dictionary = {}\n for keys, values in list(dictionary_descriptor.items()):\n new_dictionary[values] = keys","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":40150,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-23 16:43:12","func_code":"def swap_keys_values(dictionary_descriptor):\n new_dictionary = {}\n for keys, values in list(dictionary_descriptor.items()):\n new_dictionary[values] = keys\n return new_dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14262,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-23 16:43:12","func_code":"def swap_keys_values(dictionary_descriptor):\n new_dictionary = {}\n for keys, values in list(dictionary_descriptor.items()):\n new_dictionary[values] = keys\n return new_dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":22498,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-23 16:49:13","func_code":"def swap_unique_keys_values(dictionary_descriptor):\n new_dictionary = {}\n for keys, values in list(dictionary_descriptor.items()):\n try:\n new_dictionary[values] = keys\n except KeyError:\n pass\n return new_dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":13099,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-23 16:52:42","func_code":"def swap_unique_keys_values(dictionary_descriptor):\n new_dictionary = {}\n addthese = set()\n for keys, values in list(dictionary_descriptor.items()):\n addthese.update(values, keys)\n new_dictionary[addthese[values]] = addthese[keys]\n return new_dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":22048,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-23 16:55:24","func_code":"def swap_unique_keys_values(dictionary_descriptor):\n new_dictionary = {}\n addthese = set()\n for keys, values in list(dictionary_descriptor.items()):\n if values in new_dictionary:\n addthese.update(values)\n del new_dictionary[values]\n else:\n new_dictionary[values] = keys\n return new_dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":3632,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-23 16:56:16","func_code":"def swap_unique_keys_values(dictionary_descriptor):\n new_dictionary = {}\n addthese = set()\n for keys, values in list(dictionary_descriptor.items()):\n if values in new_dictionary:\n addthese.update(values)\n del new_dictionary[values]\n elif values not in new_dictionary:\n new_dictionary[values] = keys\n return new_dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":38174,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-23 16:57:08","func_code":"def swap_unique_keys_values(dictionary_descriptor):\n new_dictionary = {}\n addthese = set()\n for keys, values in list(dictionary_descriptor.items()):\n if values in new_dictionary:\n addthese.update([values])\n del new_dictionary[values]\n elif values not in new_dictionary:\n new_dictionary[values] = keys\n return new_dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":7523,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-23 16:57:08","func_code":"def swap_unique_keys_values(dictionary_descriptor):\n new_dictionary = {}\n addthese = set()\n for keys, values in list(dictionary_descriptor.items()):\n if values in new_dictionary:\n addthese.update([values])\n del new_dictionary[values]\n elif values not in new_dictionary:\n new_dictionary[values] = keys\n return new_dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":24311,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-23 16:57:08","func_code":"def swap_unique_keys_values(dictionary_descriptor):\n new_dictionary = {}\n addthese = set()\n for keys, values in list(dictionary_descriptor.items()):\n if values in new_dictionary:\n addthese.update([values])\n del new_dictionary[values]\n elif values not in new_dictionary:\n new_dictionary[values] = keys\n return new_dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":20716,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-02-23 18:24:11","func_code":"def swap_unique_keys_values(d):\n vals = list(d.values())\n return {v: k for k, v in list(d.items()) if vals.count(v) == 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":41137,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-02-23 18:24:11","func_code":"def swap_unique_keys_values(d):\n vals = list(d.values())\n return {v: k for k, v in list(d.items()) if vals.count(v) == 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":20765,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-02-23 18:29:06","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":19728,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-02-23 18:29:06","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":10296,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-02-23 18:29:06","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":36925,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-02-23 19:16:26","func_code":"def swap_keys_values(dic):\n return {val: key for key, val in list(dic.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":26692,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-02-23 19:16:26","func_code":"def swap_keys_values(dic):\n return {val: key for key, val in list(dic.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":24243,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-02-23 20:17:28","func_code":"def swap_unique_keys_values(dic):\n new_dic = {}\n add = set()\n for keys, values in list(dic.items()):\n if values in new_dic:\n add.update([values])\n del new_dic[values]\n elif values not in new_dic:\n new_dic[values] = keys\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":5515,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-02-23 20:17:28","func_code":"def swap_unique_keys_values(dic):\n new_dic = {}\n add = set()\n for keys, values in list(dic.items()):\n if values in new_dic:\n add.update([values])\n del new_dic[values]\n elif values not in new_dic:\n new_dic[values] = keys\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":34489,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-02-23 20:17:28","func_code":"def swap_unique_keys_values(dic):\n new_dic = {}\n add = set()\n for keys, values in list(dic.items()):\n if values in new_dic:\n add.update([values])\n del new_dic[values]\n elif values not in new_dic:\n new_dic[values] = keys\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":25030,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-02-23 23:31:53","func_code":"def swap_keys_values(d):\n newd = {}\n for k in d:\n newd[d[k]] = k\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":27248,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-02-23 23:31:53","func_code":"def swap_keys_values(d):\n newd = {}\n for k in d:\n newd[d[k]] = k\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":8650,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-02-23 23:45:05","func_code":"def unique_key_values(d):\n unique_d = {}\n for k in d:\n if is_unique(d[k], d):\n unique_d[k] = d[k]\n return unique_d\n\n\ndef swap_unique_keys_values(d):\n d = unique_key_values(d)\n print(d)\n newd = {}\n for k in d:\n newd[d[k]] = k\n return newd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":7582,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-02-23 23:45:25","func_code":"def unique_key_values(d):\n unique_d = {}\n for k in d:\n if is_unique(d[k], d):\n unique_d[k] = d[k]\n return unique_d\n\n\ndef swap_unique_keys_values(d):\n d = unique_key_values(d)\n newd = {}\n for k in d:\n newd[d[k]] = k\n return newd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":22669,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-02-23 23:45:25","func_code":"def unique_key_values(d):\n unique_d = {}\n for k in d:\n if is_unique(d[k], d):\n unique_d[k] = d[k]\n return unique_d\n\n\ndef swap_unique_keys_values(d):\n d = unique_key_values(d)\n newd = {}\n for k in d:\n newd[d[k]] = k\n return newd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":7269,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-24 16:47:57","func_code":"def swap_keys_values(my_dict):\n new_dict = {y: x for x, y in list(my_dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":27431,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-24 16:48:13","func_code":"def swap_keys_values(my_dict):\n new_dict = {y: x for x, y in list(my_dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":27994,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-24 16:48:13","func_code":"def swap_keys_values(my_dict):\n new_dict = {y: x for x, y in list(my_dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":31329,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-24 16:48:13","func_code":"def swap_keys_values(my_dict):\n new_dict = {y: x for x, y in list(my_dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":39423,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:26:35","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[i + 1] + l2[i + 1]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":10470,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:27:19","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[i] + 1 + (l2[i] + 1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":12429,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:28:55","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":38111,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:32:06","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":42047,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:32:06","func_code":"def weird_case(some_str):\n return some_str.upper()[::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37278,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:32:56","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27699,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:32:56","func_code":"def weird_case(some_str):\n return some_str.upper()[::2], some_str.lower()[::1]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27330,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:37:00","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33494,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:37:00","func_code":"def weird_case(some_str):\n return some_str[0].upper() + some_str[1].lower()","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":17812,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:37:22","func_code":"def weird_case(some_str):\n return some_str[::2].upper() + some_str[::1].lower()","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36785,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:37:22","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7043,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:42:30","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = leter + char.upper()\n else:\n letter = letter + char.lower()\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":42329,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:42:30","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26640,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:42:41","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21680,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:42:41","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7028,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:43:19","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4132,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:43:19","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = False\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20062,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:44:28","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13623,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:44:28","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18594,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:48:34","func_code":"def remove_zeros(list):\n return list.remove('0')","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":12700,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:48:34","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":12786,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:48:34","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":16976,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:49:57","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37194,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:49:57","func_code":"def remove_zeros(list):\n if '0' in list:\n return list.remove('0')\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":9638,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:49:57","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4833,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:52:12","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26990,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:52:12","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":7924,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 17:52:12","func_code":"def remove_zeros(list):\n if '0' in list:\n return list.pop('0')\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":18652,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 18:32:05","func_code":"def remove_zeros(list):\n if '0' in list:\n print(list.remove('0'))\n else:\n print(list)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24229,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 18:32:05","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13628,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 18:32:05","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8373,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 18:32:25","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41804,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 18:32:25","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6033,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 18:32:25","func_code":"def remove_zeros(list):\n if '0' in list:\n return list.remove('0')\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":19049,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 21:06:45","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24016,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 21:06:45","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n return list.remove('0')\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":4074,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 21:06:45","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30837,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 21:06:45","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n return list.remove('0')\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":34127,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 21:06:45","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":29127,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 21:06:45","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n return list.remove('0')\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":25462,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 21:06:45","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31925,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 21:06:45","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20985,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-24 21:06:45","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16164,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-02-24 22:55:09","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":26104,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-02-24 22:55:09","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":9393,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-02-24 22:56:11","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":17018,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-02-24 22:56:11","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":3110,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-24 23:46:42","func_code":"def swap_unique_keys_values(d):\n oldvalues = [v for v in list(d.values())]\n oldkeys = [k for k in list(d.keys())]\n counts = {}\n for v in oldvalues:\n if v not in counts:\n counts[v] = 1\n else:\n counts[v] += 1\n unique = []\n for v in counts:\n if counts[v] == 1:\n unique.append(v)\n reverseddic = {}\n for i in range(0, len(oldvalues)):\n reverseddic[oldvalues[i]] = oldkeys[i]\n newdic = {}\n for k, v in list(reverseddic.items()):\n if k in unique:\n newdic[k] = v\n return newdic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":39093,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-24 23:46:56","func_code":"def swap_unique_keys_values(d):\n oldvalues = [v for v in list(d.values())]\n oldkeys = [k for k in list(d.keys())]\n counts = {}\n for v in oldvalues:\n if v not in counts:\n counts[v] = 1\n else:\n counts[v] += 1\n unique = []\n for v in counts:\n if counts[v] == 1:\n unique.append(v)\n reverseddic = {}\n for i in range(0, len(oldvalues)):\n reverseddic[oldvalues[i]] = oldkeys[i]\n newdic = {}\n for k, v in list(reverseddic.items()):\n if k in unique:\n newdic[k] = v\n return newdic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":10028,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-24 23:46:56","func_code":"def swap_unique_keys_values(d):\n oldvalues = [v for v in list(d.values())]\n oldkeys = [k for k in list(d.keys())]\n counts = {}\n for v in oldvalues:\n if v not in counts:\n counts[v] = 1\n else:\n counts[v] += 1\n unique = []\n for v in counts:\n if counts[v] == 1:\n unique.append(v)\n reverseddic = {}\n for i in range(0, len(oldvalues)):\n reverseddic[oldvalues[i]] = oldkeys[i]\n newdic = {}\n for k, v in list(reverseddic.items()):\n if k in unique:\n newdic[k] = v\n return newdic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":7544,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-02-24 23:46:56","func_code":"def swap_unique_keys_values(d):\n oldvalues = [v for v in list(d.values())]\n oldkeys = [k for k in list(d.keys())]\n counts = {}\n for v in oldvalues:\n if v not in counts:\n counts[v] = 1\n else:\n counts[v] += 1\n unique = []\n for v in counts:\n if counts[v] == 1:\n unique.append(v)\n reverseddic = {}\n for i in range(0, len(oldvalues)):\n reverseddic[oldvalues[i]] = oldkeys[i]\n newdic = {}\n for k, v in list(reverseddic.items()):\n if k in unique:\n newdic[k] = v\n return newdic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":5744,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 01:42:29","func_code":"def swap_keys_values(dict):\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":12249,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 01:48:46","func_code":"def swap_unique_keys_values(dict):\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":32532,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 01:52:34","func_code":"def swap_unique_keys_values(dict):\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":34132,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 01:52:57","func_code":"def swap_unique_keys_values(dict):\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":14184,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 01:53:40","func_code":"def swap_unique_keys_values(dict):\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":11395,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 01:55:15","func_code":"def swap_unique_keys_values(dict):\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":14582,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 01:55:45","func_code":"def swap_unique_keys_values(dict):\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":33402,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 01:56:00","func_code":"def swap_unique_keys_values(dict):\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":3429,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 01:56:27","func_code":"def swap_unique_keys_values(dict):\n for k in dict:\n print(k)\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":38850,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 01:56:59","func_code":"def swap_unique_keys_values(dict):\n for k, v in list(dict.items()):\n print(v)\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":38758,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 02:00:34","func_code":"def swap_unique_keys_values(dict):\n dict1 = {}\n a = []\n for k, v in list(dict.items()):\n a.append(v)\n for k, v in list(dict.items()):\n if a.count('v') == 1:\n dict1[k] = v\n new_dict = {v: k for k, v in list(dict1.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":13704,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 02:01:19","func_code":"def swap_unique_keys_values(dict):\n dict1 = {}\n a = []\n for k, v in list(dict.items()):\n a.append(v)\n print(a)\n for k, v in list(dict.items()):\n if a.count('v') == 1:\n dict1[k] = v\n print(dict1)\n new_dict = {v: k for k, v in list(dict1.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35707,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 02:02:30","func_code":"def swap_unique_keys_values(dict):\n dict1 = {}\n a = []\n for k, v in list(dict.items()):\n a.append(v)\n print(a)\n for k, v in list(dict.items()):\n print(a.count('v'))\n new_dict = {v: k for k, v in list(dict1.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":16446,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 02:02:59","func_code":"def swap_unique_keys_values(dict):\n dict1 = {}\n a = []\n for k, v in list(dict.items()):\n a.append(v)\n for k, v in list(dict.items()):\n if a.count(v) == 1:\n dict1[k] = v\n new_dict = {v: k for k, v in list(dict1.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":39030,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 02:03:49","func_code":"def swap_unique_keys_values(dict):\n dict1 = {}\n a = []\n for k, v in list(dict.items()):\n a.append(v)\n for k, v in list(dict.items()):\n if a.count(v) == 1:\n dict1[k] = v\n new_dict = {v: k for k, v in list(dict1.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":29412,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 02:04:15","func_code":"def swap_keys_values(dict):\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":32743,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 02:04:29","func_code":"def swap_unique_keys_values(dict):\n dict1 = {}\n a = []\n for k, v in list(dict.items()):\n a.append(v)\n for k, v in list(dict.items()):\n if a.count(v) == 1:\n dict1[k] = v\n new_dict = {v: k for k, v in list(dict1.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":26077,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 02:04:33","func_code":"def swap_keys_values(dict):\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":37630,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 02:04:33","func_code":"def swap_keys_values(dict):\n new_dict = {v: k for k, v in list(dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":34652,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 02:04:47","func_code":"def swap_unique_keys_values(dict):\n dict1 = {}\n a = []\n for k, v in list(dict.items()):\n a.append(v)\n for k, v in list(dict.items()):\n if a.count(v) == 1:\n dict1[k] = v\n new_dict = {v: k for k, v in list(dict1.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":4913,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-02-25 02:04:47","func_code":"def swap_unique_keys_values(dict):\n dict1 = {}\n a = []\n for k, v in list(dict.items()):\n a.append(v)\n for k, v in list(dict.items()):\n if a.count(v) == 1:\n dict1[k] = v\n new_dict = {v: k for k, v in list(dict1.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":14515,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 12:29:53","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1.append[i]\n i = i + 2\n j = 0\n merging2 = l2.append[i]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":2087,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 12:30:35","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1.append[i]\n i = i + 2\n j = 0\n merging2 = l2.append[i]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31757,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 12:41:36","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1[i]\n i = i + 2\n j = 0\n merging2 = l2[i]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":38465,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 12:42:41","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1[i]\n i = i + 2\n j = 0\n merging2 = l2[i]\n j = j + 2\n mergedlist = merging1 + merging2\n return merging1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":24625,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 12:43:08","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1[i]\n i = i + 2\n j = 0\n merging2 = l2[j]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":4697,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 12:54:11","func_code":"def weird_case(some_str):\n ret = ''\n i = True\n for char in some_str:\n if i:\n ret += char.upper()\n else:\n ret += char.lower()\n if char != ' ':\n i = not i\n return ret","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18760,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 12:54:11","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1[i]\n i = i + 2\n j = 0\n merging2 = l2[j]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":39277,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 13:01:03","func_code":"def remove_zeros(list, val):\n for i in range(list.count(val)):\n list.remove(val)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":3100,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 13:01:03","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1[i]\n i = i + 2\n j = 0\n merging2 = l2[j]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15413,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 13:01:03","func_code":"def remove_zeros(list, val):\n for i in range(list.count(val)):\n list.remove(val)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":11129,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 13:01:03","func_code":"def weird_case(some_str):\n ret = ''\n i = True\n for char in some_str:\n if i:\n ret += char.upper()\n else:\n ret += char.lower()\n if char != ' ':\n i = not i\n return ret","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":42253,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 13:01:03","func_code":"def weird_case(some_str):\n ret = ''\n i = True\n for char in some_str:\n if i:\n ret += char.upper()\n else:\n ret += char.lower()\n if char != ' ':\n i = not i\n return ret","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33424,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 13:01:03","func_code":"def remove_zeros(list, val):\n for i in range(list.count(val)):\n list.remove(val)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":16292,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 13:01:03","func_code":"def weird_case(some_str):\n ret = ''\n i = True\n for char in some_str:\n if i:\n ret += char.upper()\n else:\n ret += char.lower()\n if char != ' ':\n i = not i\n return ret","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":34856,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 13:01:03","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1[i]\n i = i + 2\n j = 0\n merging2 = l2[j]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":12737,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-25 13:01:03","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1[i]\n i = i + 2\n j = 0\n merging2 = l2[j]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":8917,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-25 14:00:18","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":8197,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-25 14:00:18","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24399,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-25 14:00:18","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":32773,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-25 14:00:18","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29587,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-25 14:00:18","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19274,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-25 14:00:18","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":40521,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-25 14:31:39","func_code":"def swap_unique_keys_values(my_dict):\n seen = []\n unseen = []\n for key in list(my_dict.keys()):\n value = my_dict[key]\n if value in seen:\n unseen.append(value)\n else:\n seen.append(value)\n new_dict = {k: v for k, v in list(my_dict.items()) if v not in unseen}\n new_dict = {y: x for x, y in list(new_dict.items())}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":7865,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-25 14:35:55","func_code":"def swap_unique_keys_values(my_dict):\n seen = []\n unseen = []\n for key in list(my_dict.keys()):\n value = my_dict[key]\n if value in seen:\n unseen.append(value)\n else:\n seen.append(value)\n new_dict = {v: k for k, v in list(my_dict.items()) if v not in unseen}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":33029,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-25 14:36:13","func_code":"def swap_unique_keys_values(my_dict):\n seen = []\n unseen = []\n for key in list(my_dict.keys()):\n value = my_dict[key]\n if value in seen:\n unseen.append(value)\n else:\n seen.append(value)\n new_dict = {v: k for k, v in list(my_dict.items()) if v not in unseen}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":38002,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-25 14:36:32","func_code":"def swap_keys_values(my_dict):\n new_dict = {v: k for k, v in list(my_dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":24605,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-25 14:36:32","func_code":"def swap_keys_values(my_dict):\n new_dict = {v: k for k, v in list(my_dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":28755,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-25 14:37:40","func_code":"def swap_unique_keys_values(my_dict):\n seen = []\n unseen = []\n for key in list(my_dict.keys()):\n value = my_dict[key]\n if value in unseen:\n seen.append(value)\n else:\n unseen.append(value)\n new_dict = {v: k for k, v in list(my_dict.items()) if v not in seen}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":10912,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-25 14:37:49","func_code":"def swap_unique_keys_values(my_dict):\n seen = []\n unseen = []\n for key in list(my_dict.keys()):\n value = my_dict[key]\n if value in unseen:\n seen.append(value)\n else:\n unseen.append(value)\n new_dict = {v: k for k, v in list(my_dict.items()) if v not in seen}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":32427,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-25 14:37:49","func_code":"def swap_unique_keys_values(my_dict):\n seen = []\n unseen = []\n for key in list(my_dict.keys()):\n value = my_dict[key]\n if value in unseen:\n seen.append(value)\n else:\n unseen.append(value)\n new_dict = {v: k for k, v in list(my_dict.items()) if v not in seen}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":12142,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-02-25 14:37:49","func_code":"def swap_unique_keys_values(my_dict):\n seen = []\n unseen = []\n for key in list(my_dict.keys()):\n value = my_dict[key]\n if value in unseen:\n seen.append(value)\n else:\n unseen.append(value)\n new_dict = {v: k for k, v in list(my_dict.items()) if v not in seen}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":16617,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-02-25 15:21:32","func_code":"def swap_keys_values(d):\n for k, v in list(d.items()):\n del d[k]\n d[v] = k","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":20047,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-02-25 15:21:32","func_code":"def swap_keys_values(d):\n for k, v in list(d.items()):\n del d[k]\n d[v] = k","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":20270,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-02-25 16:12:24","func_code":"def swap_unique_keys_values(dictionary):\n values = []\n new_dict = {}\n for key in dictionary:\n values.append(dictionary[key])\n for key, value in list(dictionary.items()):\n if values.count(value) == 1:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":18888,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-02-25 16:12:24","func_code":"def swap_unique_keys_values(dictionary):\n values = []\n new_dict = {}\n for key in dictionary:\n values.append(dictionary[key])\n for key, value in list(dictionary.items()):\n if values.count(value) == 1:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":1770,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-02-25 16:12:24","func_code":"def swap_unique_keys_values(dictionary):\n values = []\n new_dict = {}\n for key in dictionary:\n values.append(dictionary[key])\n for key, value in list(dictionary.items()):\n if values.count(value) == 1:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":2791,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-02-25 16:14:05","func_code":"def swap_keys_values(original_dict):\n swapped_dict = {}\n for key in original_dict:\n swapped_dict[original_dict[key]] = key\n return swapped_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":31168,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-02-25 16:14:05","func_code":"def swap_keys_values(original_dict):\n swapped_dict = {}\n for key in original_dict:\n swapped_dict[original_dict[key]] = key\n return swapped_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":15890,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-02-25 16:25:53","func_code":"def swap_unique_keys_values(dic):\n unique_dict = {}\n for key in dic:\n if list(dic.values()).count(dic[key]) == 1:\n unique_dict[dic[key]] = key\n return unique_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":26265,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-02-25 16:40:55","func_code":"def swap_unique_keys_values(dic):\n dic = {'a': 4, 'b': 7, 'c': 10, 'd': 7}\n list_of_values = [dic[value] for value in dic]\n unique_dict = {}\n for key in dic:\n if list_of_values.count(dic[key]) == 1:\n unique_dict[dic[key]] = key\n return unique_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":19836,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-02-25 16:40:55","func_code":"def swap_unique_keys_values(dic):\n dic = {'a': 4, 'b': 7, 'c': 10, 'd': 7}\n list_of_values = [dic[value] for value in dic]\n unique_dict = {}\n for key in dic:\n if list_of_values.count(dic[key]) == 1:\n unique_dict[dic[key]] = key\n return unique_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":7358,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-02-25 16:40:55","func_code":"def swap_unique_keys_values(dic):\n dic = {'a': 4, 'b': 7, 'c': 10, 'd': 7}\n list_of_values = [dic[value] for value in dic]\n unique_dict = {}\n for key in dic:\n if list_of_values.count(dic[key]) == 1:\n unique_dict[dic[key]] = key\n return unique_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":21197,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-02-25 16:56:46","func_code":"def swap_keys_values(d):\n a = {}\n for k, v in list(d.items()):\n a[v] = k\n return a","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":2923,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-02-25 16:56:46","func_code":"def swap_keys_values(d):\n a = {}\n for k, v in list(d.items()):\n a[v] = k\n return a","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":8188,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-02-25 16:56:46","func_code":"def swap_keys_values(d):\n a = {}\n for k, v in list(d.items()):\n a[v] = k\n return a","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":37976,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-25 17:02:58","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":31120,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-25 17:03:21","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":25691,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-25 17:03:21","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18353,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-02-25 17:03:21","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18855,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-02-25 19:15:12","func_code":"def swap_keys_values(d):\n new_dict = {}\n i = 0\n while i < len(d):\n new_dict[d[0]] = d[1]\n i += 1\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":29365,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-02-25 19:16:22","func_code":"def swap_keys_values(d):\n print(d)\n new_dict = {}\n i = 0\n while i < len(d):\n new_dict[d[i]] = d[0]\n i += 1\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":9135,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-02-25 19:23:16","func_code":"def swap_keys_values(d):\n print(d)\n new_dict = {}\n print(list(d.keys()))\n print(list(d.items()))\n print(list(d.values()))\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":41327,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-02-25 19:23:29","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":3561,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-02-25 19:23:43","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21327,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-02-25 19:24:03","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":40738,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-02-25 19:24:03","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":17141,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-02-25 19:24:03","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":4204,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-25 22:35:32","func_code":"def merge_lists(l1, l2):\n l3 = []","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":12542,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-02-25 23:54:24","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in new_d:\n new_d[v] = k\n else:\n del new_d[v]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":8601,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-02-25 23:54:24","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in new_d:\n new_d[v] = k\n else:\n del new_d[v]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":34493,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-02-25 23:54:24","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in new_d:\n new_d[v] = k\n else:\n del new_d[v]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":25687,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-26 09:30:01","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n for key in d:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":25810,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-26 09:30:01","func_code":"def swap_keys_values(d):\n keys = []\n values = []\n for key in d:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":15816,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-26 10:33:44","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n for key in d:\n if d[key] not in values:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":25212,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-26 10:35:43","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n for key in d:\n if d.count(d[key]) == 1:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":17228,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-26 10:36:29","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n for key in d:\n values.append(d[key])\n for key in d:\n if d.count(values) == 1:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29979,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-26 10:37:14","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n for key in d:\n values.append(d[key])\n print(values)\n for key in d:\n if d.count(values) == 1:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":12213,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-26 10:37:53","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n for key in d:\n values.append(d[key])\n for key in d:\n if values.count(d[key]) == 1:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":3457,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-26 10:42:20","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n i = 0\n while i < len(d):\n values.append(d[key])\n for key in d:\n if values.count(d[key]) == 1:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6169,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-26 10:42:47","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n i = 0\n while i < len(d):\n values.append(d[i])\n for key in d:\n if values.count(d[key]) == 1:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":12594,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-26 10:42:47","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n i = 0\n while i < len(d):\n values.append(d[i])\n for key in d:\n if values.count(d[key]) == 1:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":12308,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-26 10:42:47","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n i = 0\n while i < len(d):\n values.append(d[i])\n for key in d:\n if values.count(d[key]) == 1:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":24865,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-02-26 10:46:40","func_code":"def swap_unique_keys_values(d):\n pairs = list(d.items())\n new_d = {}\n for key, value in pairs:\n if not value in new_d:\n new_d[value] = key\n else:\n del new_d[value]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6817,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-02-26 10:49:09","func_code":"def swap_unique_keys_values(d):\n pairs = list(d.items())\n new_d = {}\n for key, value in pairs:\n if not value in new_d:\n new_d[value] = key\n else:\n del new_d[value]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":1028,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-02-26 10:49:09","func_code":"def swap_unique_keys_values(d):\n pairs = list(d.items())\n new_d = {}\n for key, value in pairs:\n if not value in new_d:\n new_d[value] = key\n else:\n del new_d[value]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":28699,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-02-26 10:49:09","func_code":"def swap_unique_keys_values(d):\n pairs = list(d.items())\n new_d = {}\n for key, value in pairs:\n if not value in new_d:\n new_d[value] = key\n else:\n del new_d[value]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":36841,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-02-26 12:56:19","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14804,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-02-26 12:56:19","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":19105,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-02-26 13:02:11","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in list(new_d.keys()):\n new_d[v] = k\n else:\n 0\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":19702,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-02-26 13:12:16","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in list(new_d.keys()):\n new_d[v] = k\n else:\n new_d.pop(v)\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":1781,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-02-26 13:12:16","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in list(new_d.keys()):\n new_d[v] = k\n else:\n new_d.pop(v)\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6347,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-02-26 13:12:16","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in list(new_d.keys()):\n new_d[v] = k\n else:\n new_d.pop(v)\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":29597,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-26 13:31:29","func_code":"def swap_unique_keys_values(d):\n seen = {}\n new_d = {}\n for k in d:\n seen[k] += 1\n for item in seen:\n if d[item] == 1:\n new_d[item] = True\n for k in new_d:\n for key in d:\n if k in d:\n new_d[k] = d[key]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29261,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-26 13:35:28","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k in d:\n if not d.count(d[k]) > 1:\n new_d[k] = d[k]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":24872,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-26 13:40:55","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n vv = []\n for k in d:\n vv.append(d[k])\n for num in vv:\n for k in d:\n if not vv.count(num) > 1:\n if d[k] == num:\n new_d[k] = num\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29821,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-26 13:41:28","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n vv = []\n for k in d:\n vv.append(d[k])\n for num in vv:\n for k in d:\n if not vv.count(num) > 1:\n if d[k] == num:\n new_d[num] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":714,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-26 13:41:50","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n vv = []\n for k in d:\n vv.append(d[k])\n for num in vv:\n for k in d:\n if not vv.count(num) > 1:\n if d[k] == num:\n new_d[num] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":22182,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-26 13:41:50","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n vv = []\n for k in d:\n vv.append(d[k])\n for num in vv:\n for k in d:\n if not vv.count(num) > 1:\n if d[k] == num:\n new_d[num] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":39550,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-02-26 13:41:50","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n vv = []\n for k in d:\n vv.append(d[k])\n for num in vv:\n for k in d:\n if not vv.count(num) > 1:\n if d[k] == num:\n new_d[num] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":38691,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:00","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":10291,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:27","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33648,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:27","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1108,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:48","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":39041,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:48","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":27387,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:48","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":11239,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:48","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33788,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:48","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20050,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:48","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":26842,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:48","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23789,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:48","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str += letter.upper()\n else:\n new_str += letter.lower()\n if letter != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8001,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-02-26 13:49:48","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":22059,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-26 14:40:13","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23607,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-26 14:42:38","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":29237,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-26 15:00:26","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17092,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-26 15:00:26","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20553,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-26 15:00:26","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":17453,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-26 15:00:26","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40762,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-26 15:00:26","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20444,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-26 15:00:26","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24778,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-26 15:03:27","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37500,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-26 15:12:52","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n if 'a' <= some_str[i] <= 'z':\n print(some_str[i])\n i += 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31372,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-26 15:12:52","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36659,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-26 15:14:01","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11075,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-26 15:14:01","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n if 'a' <= some_str[i] <= 'z':\n print(some_str[i])\n else:\n print(some_str[i])\n i += 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38019,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-26 15:15:19","func_code":"def merge_lists(l1, l2):\n number = []\n i = 0\n while i < len(l1):\n number.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n number.append(l2[j])\n j = j + 2\n return number","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36304,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-26 15:16:23","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14431,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-26 15:16:23","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2757,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-26 15:16:23","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n while i < len(some_str):\n if 'a' <= some_str[i] <= 'z':\n j += 1\n if j % 2 == 1:\n print(upper(some_str[i]))\n else:\n print(some_str[i])\n else:\n print(some_str[i])\n i += 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1609,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-26 15:16:23","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24589,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-26 15:16:23","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n while i < len(some_str):\n if 'a' <= some_str[i] <= 'z':\n j += 1\n if j % 2 == 1:\n print(upper(some_str[i]))\n else:\n print(some_str[i])\n else:\n print(some_str[i])\n i += 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26562,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-02-26 15:16:23","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n while i < len(some_str):\n if 'a' <= some_str[i] <= 'z':\n j += 1\n if j % 2 == 1:\n print(upper(some_str[i]))\n else:\n print(some_str[i])\n else:\n print(some_str[i])\n i += 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22007,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 15:26:05","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11578,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 15:26:05","func_code":"def remove_zeros(x):\n if x[i] == 0:\n del x[i]\n if x[i] == 0:\n del x[i]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":12998,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 15:28:19","func_code":"def remove_zeros(x):\n while i < len(x):\n if x[i] == 0:\n del x[i]\n if x[i] == 0:\n del x[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":22995,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 15:28:19","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27543,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 15:31:20","func_code":"def remove_zeros(x):\n i = 0\n while i < len(x):\n if x[i] == 0:\n del x[i]\n if x[i] == 0:\n del x[i]\n i = i + 1\n return x","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":25128,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 15:31:20","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30225,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-02-26 15:37:21","func_code":"def swap_keys_values(d):\n return {v: d for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":1761,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-02-26 15:39:48","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":1007,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-02-26 15:39:48","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21230,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-02-26 16:02:37","func_code":"def swap_unique_keys_values(d):\n dvalues = [v for v in list(d.values())]\n return {v: k for k, v in list(d.items()) if dvalues.count(v) < 2}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":27931,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-02-26 16:02:37","func_code":"def swap_unique_keys_values(d):\n dvalues = [v for v in list(d.values())]\n return {v: k for k, v in list(d.items()) if dvalues.count(v) < 2}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":4666,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-02-26 16:02:37","func_code":"def swap_unique_keys_values(d):\n dvalues = [v for v in list(d.values())]\n return {v: k for k, v in list(d.items()) if dvalues.count(v) < 2}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":4398,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-26 16:34:46","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n elif a[i] == 0:\n del a[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":8224,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-26 16:34:46","func_code":"def merge_lists(l1, l2):\n number = []\n i = 0\n while i < len(l1):\n number.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n number.append(l2[j])\n j = j + 2\n return number","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41921,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-26 16:35:13","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":5267,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-26 16:35:13","func_code":"def merge_lists(l1, l2):\n number = []\n i = 0\n while i < len(l1):\n number.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n number.append(l2[j])\n j = j + 2\n return number","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4780,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-26 16:35:13","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40203,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-26 16:35:13","func_code":"def merge_lists(l1, l2):\n number = []\n i = 0\n while i < len(l1):\n number.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n number.append(l2[j])\n j = j + 2\n return number","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":1376,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:03:52","func_code":"def merge_lists(l1, l2):\n a = l1[0::2]\n b = l2[0::2]\n return a + b","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":118,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:12:15","func_code":"def merge_lists(l1, l2):\n a = l1[0::2]\n b = l2[0::2]\n return a + b","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18666,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:12:15","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n else:\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":20400,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:29:23","func_code":"def weird_case(some_str):\n i = 0\n ls = []\n while i < len(some_str):\n if i % 2 == 0:\n ls.append(some_str[i].upper())\n else:\n ls.append(some_str[i].lower())\n i = i + 1\n return ''.join(ls)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26818,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:29:23","func_code":"def merge_lists(l1, l2):\n a = l1[0::2]\n b = l2[0::2]\n return a + b","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6142,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:29:23","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n else:\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":41284,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:30:59","func_code":"def merge_lists(l1, l2):\n a = l1[0::2]\n b = l2[0::2]\n return a + b","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37375,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:30:59","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n else:\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":10215,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:30:59","func_code":"def weird_case(some_str):\n i = 0\n ls = []\n while i < len(some_str):\n if i % 2 == 0:\n ls.append(some_str[i].upper())\n else:\n ls.append(some_str[i].lower())\n i = i + 1\n return ''.join(ls)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32879,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:30:59","func_code":"def merge_lists(l1, l2):\n a = l1[0::2]\n b = l2[0::2]\n return a + b","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24211,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:30:59","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n else:\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":2774,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:30:59","func_code":"def weird_case(some_str):\n i = 0\n ls = []\n while i < len(some_str):\n if i % 2 == 0:\n ls.append(some_str[i].upper())\n else:\n ls.append(some_str[i].lower())\n i = i + 1\n return ''.join(ls)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16619,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:30:59","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n else:\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":16301,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:30:59","func_code":"def merge_lists(l1, l2):\n a = l1[0::2]\n b = l2[0::2]\n return a + b","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27874,"user":"6255611e-aa05-47ab-ba1e-1c5ae86413eb","date":"2018-02-26 17:30:59","func_code":"def weird_case(some_str):\n i = 0\n ls = []\n while i < len(some_str):\n if i % 2 == 0:\n ls.append(some_str[i].upper())\n else:\n ls.append(some_str[i].lower())\n i = i + 1\n return ''.join(ls)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29270,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:50:08","func_code":"def weird_case(string):\n i = True\n string1 = ' '\n for char in string:\n if i:\n string1 += char.upper\n else:\n string1 += letter.lower\n if letter != ' ':\n i = not i","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15741,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:50:08","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":10229,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:50:08","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.pop(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":3903,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:51:00","func_code":"def weird_case(string):\n i = True\n string1 = ' '\n for char in string:\n if i:\n string1 += char.upper()\n else:\n string1 += char.lower()\n if char != ' ':\n i = not i","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16981,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:51:00","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31325,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:51:00","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.pop(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":25892,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:16","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.pop(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":82,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:16","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":5640,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:16","func_code":"def weird_case(string):\n i = True\n string1 = ' '\n for char in string:\n if i:\n string1 += char.upper()\n else:\n string1 += char.lower()\n if char != ' ':\n i = not i\n return string1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19651,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:51","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":19124,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:51","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.pop(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40488,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:51","func_code":"def weird_case(string):\n i = True\n string1 = ''\n for char in string:\n if i:\n string1 += char.upper()\n else:\n string1 += char.lower()\n if char != ' ':\n i = not i\n return string1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":5752,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:51","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37104,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:51","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.pop(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21679,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:51","func_code":"def weird_case(string):\n i = True\n string1 = ''\n for char in string:\n if i:\n string1 += char.upper()\n else:\n string1 += char.lower()\n if char != ' ':\n i = not i\n return string1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":23956,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:51","func_code":"def weird_case(string):\n i = True\n string1 = ''\n for char in string:\n if i:\n string1 += char.upper()\n else:\n string1 += char.lower()\n if char != ' ':\n i = not i\n return string1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16901,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:51","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.pop(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":12530,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-02-26 17:52:51","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":845,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:33:51","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27001,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:33:51","func_code":"def remove_zeros(x):\n i = 0\n while i < len(x):\n if x[i] == 0:\n del x[i]\n if x[i] == 0:\n del x[i]\n i = i + 1\n return x","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":33345,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:47:54","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25657,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:47:54","func_code":"def remove_zeros(x):\n i = 0\n while i < len(x):\n if x[i] == 0:\n del x[i]\n if x[i] == 0:\n del x[i]\n i = i + 1\n return x","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":9520,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:47:54","func_code":"def weird_case(lines):\n lines = input()\n lines = lines.upper().split()\n a = lines[0]\n b = lines[1]\n c = lines[2]\n a1 = ''\n b2 = ''\n c3 = ''\n i = 0\n while i < len(a):\n if i % 2 == 0:\n a1 += a[i]\n else:\n a1 += a[i].lower()\n i = i + 1\n i = 0\n while i < len(b):\n if i % 2 == 0:\n b2 += b[i]\n else:\n b2 += b[i].lower()\n i = i + 1\n i = 0\n while i < len(c):\n if i % 2 != 0:\n c3 += c[i]\n else:\n c3 += c[i].lower()\n i = i + 1\n return a1, b2, c3","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13053,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:48:54","func_code":"def weird_case(lines):\n lines = lines.upper().split()\n a = lines[0]\n b = lines[1]\n c = lines[2]\n a1 = ''\n b2 = ''\n c3 = ''\n i = 0\n while i < len(a):\n if i % 2 == 0:\n a1 += a[i]\n else:\n a1 += a[i].lower()\n i = i + 1\n i = 0\n while i < len(b):\n if i % 2 == 0:\n b2 += b[i]\n else:\n b2 += b[i].lower()\n i = i + 1\n i = 0\n while i < len(c):\n if i % 2 != 0:\n c3 += c[i]\n else:\n c3 += c[i].lower()\n i = i + 1\n return a1, b2, c3","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8173,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:48:54","func_code":"def remove_zeros(x):\n i = 0\n while i < len(x):\n if x[i] == 0:\n del x[i]\n if x[i] == 0:\n del x[i]\n i = i + 1\n return x","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":7759,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:48:54","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2949,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:51:18","func_code":"def remove_zeros(x):\n i = 0\n while i < len(x):\n if x[i] == 0:\n del x[i]\n if x[i] == 0:\n del x[i]\n i = i + 1\n return x","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":38973,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:51:18","func_code":"def weird_case(lines):\n lines = lines.upper().split()\n a = lines[0]\n b = lines[1]\n c = lines[2]\n a1 = ''\n b2 = ''\n c3 = ''\n i = 0\n while i < len(a):\n if i % 2 == 0:\n a1 += a[i]\n else:\n a1 += a[i].lower()\n i = i + 1\n i = 0\n while i < len(b):\n if i % 2 == 0:\n b2 += b[i]\n else:\n b2 += b[i].lower()\n i = i + 1\n i = 0\n while i < len(c):\n if i % 2 != 0:\n c3 += c[i]\n else:\n c3 += c[i].lower()\n i = i + 1\n return a1 + ' ' + b2 + ' ' + c3","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11684,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:51:18","func_code":"def weird_case(lines):\n lines = lines.upper().split()\n a = lines[0]\n b = lines[1]\n c = lines[2]\n a1 = ''\n b2 = ''\n c3 = ''\n i = 0\n while i < len(a):\n if i % 2 == 0:\n a1 += a[i]\n else:\n a1 += a[i].lower()\n i = i + 1\n i = 0\n while i < len(b):\n if i % 2 == 0:\n b2 += b[i]\n else:\n b2 += b[i].lower()\n i = i + 1\n i = 0\n while i < len(c):\n if i % 2 != 0:\n c3 += c[i]\n else:\n c3 += c[i].lower()\n i = i + 1\n return a1 + ' ' + b2 + ' ' + c3","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24567,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:51:18","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17656,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:51:18","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14803,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:51:18","func_code":"def remove_zeros(x):\n i = 0\n while i < len(x):\n if x[i] == 0:\n del x[i]\n if x[i] == 0:\n del x[i]\n i = i + 1\n return x","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":12321,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:51:18","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17398,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:51:18","func_code":"def remove_zeros(x):\n i = 0\n while i < len(x):\n if x[i] == 0:\n del x[i]\n if x[i] == 0:\n del x[i]\n i = i + 1\n return x","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":7994,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-02-26 18:51:18","func_code":"def weird_case(lines):\n lines = lines.upper().split()\n a = lines[0]\n b = lines[1]\n c = lines[2]\n a1 = ''\n b2 = ''\n c3 = ''\n i = 0\n while i < len(a):\n if i % 2 == 0:\n a1 += a[i]\n else:\n a1 += a[i].lower()\n i = i + 1\n i = 0\n while i < len(b):\n if i % 2 == 0:\n b2 += b[i]\n else:\n b2 += b[i].lower()\n i = i + 1\n i = 0\n while i < len(c):\n if i % 2 != 0:\n c3 += c[i]\n else:\n c3 += c[i].lower()\n i = i + 1\n return a1 + ' ' + b2 + ' ' + c3","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25515,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 18:59:55","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":34121,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 18:59:55","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":30409,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 18:59:55","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9865,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:00:38","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22795,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:00:38","func_code":"def remove_zeros(a):\n i = 1\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":3917,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:00:38","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":37939,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:01:23","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":25323,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:01:23","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":9830,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:01:23","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24127,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:01:49","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == '0':\n a.remove(a[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":14703,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:01:49","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2174,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:01:49","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":12619,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:02:16","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n print(a[i])\n if a[i] == '0':\n a.remove(a[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":33868,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:02:16","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":23796,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:02:16","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":42176,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:03:44","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39855,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:03:44","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if int(a[i]) <= 1 and int(a[i]) >= -1:\n a.remove(a[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":411,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:03:44","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31248,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:05:30","func_code":"def remove_zeros(a):\n i = 0\n while len(a):\n if int(a[len(a) - i]) == 0:\n a.remove(a[len(a) - i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":31293,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:05:30","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31989,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:05:30","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28542,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:05:54","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":5902,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:05:54","func_code":"def remove_zeros(a):\n i = 0\n while len(a):\n if int(a[len(a) - i - 1]) == 0:\n a.remove(a[len(a) - i - 1])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":3257,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:05:54","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":7741,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:06:39","func_code":"def remove_zeros(a):\n i = 0\n while len(a):\n print(len(a) - i)\n if int(a[len(a) - i]) == 0:\n a.remove(a[len(a) - i - 1])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":13744,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:06:39","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33662,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:06:39","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":12647,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:07:06","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19204,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:07:06","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n print(len(a) - i - 1)\n if int(a[len(a) - i]) == 0:\n a.remove(a[len(a) - i - 1])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":21159,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:07:06","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31358,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:07:50","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if int(a[len(a) - i - 1]) == 0:\n a.remove(a[len(a) - i - 1])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":41009,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:07:50","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":34178,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:07:50","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4493,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:08:07","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":12919,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:08:07","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39809,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:08:07","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if int(a[len(a) - i]) == 0:\n a.remove(a[len(a) - i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":17194,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:08:29","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n print(a[0])\n if int(a[len(a) - i]) == 0:\n a.remove(a[len(a) - i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":27582,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:08:29","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22053,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:08:29","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":8209,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:08:54","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16493,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:08:54","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n print(a[0])\n print(len(a))\n if int(a[len(a) - i]) == 0:\n a.remove(a[len(a) - i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":935,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:08:54","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":35206,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:09:37","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":9199,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:09:37","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":25220,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:09:37","func_code":"def remove_zeros(a):\n i = 1\n while i < len(a):\n if int(a[len(a) - i]) == 0:\n a.remove(a[len(a) - i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":7840,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:10:50","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2717,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:10:50","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if int(a[len(a) - i - 1]) == 0:\n a.remove(a[len(a) - i - 1])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21800,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:10:50","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":20223,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:12:24","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40842,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:12:24","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":24154,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:12:24","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if int(a[len(a) - i - 1]) == 0:\n print(a[len(a) - i - 1])\n a.remove(a[len(a) - i - 1])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":6203,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:13:59","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33178,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:13:59","func_code":"def remove_zeros(a):\n i = 1\n while i <= len(a):\n if int(a[len(a) - i]) == 0:\n a.remove(a[len(a) - i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":5694,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:13:59","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22210,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-26 19:16:45","func_code":"def merge_lists(l1, l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n while j < len(l2):\n if l2[j] in l2:\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7247,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-26 19:16:45","func_code":"def weird_case(some_str):\n sent = ''\n i = True\n for words in some_str:\n if i:\n sent += words.upper()\n else:\n sent += words.lower()\n if words != ' ':\n i = not i\n return sent","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":535,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:17:38","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":38852,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:17:38","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11743,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:17:38","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n print(len(a))\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38581,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:18:11","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":41046,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:18:11","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n print(len(a))\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24700,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:18:11","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35177,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:18:28","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3901,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:18:28","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":1265,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:18:28","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":7624,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:19:04","func_code":"def weird_case(n):\n print(n)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36878,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:19:04","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":30526,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:19:04","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31288,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:19:57","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":8742,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:19:57","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10664,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:19:57","func_code":"def weird_case(n):\n print(n.strip('\\n'))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2957,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:20:30","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":7200,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:20:57","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":6091,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:21:12","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":40016,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:22:12","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24456,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:22:12","func_code":"def weird_case(n):\n line = n.strip('\\n').split(' ')\n print(len(line))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":467,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:22:12","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22629,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:23:10","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n l4 = []\n i = 0\n while i < len(l3):\n l4.append(l3[i])\n i = i + 2\n return l4","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24770,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-26 19:23:26","func_code":"def merge_lists(l1, l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n while j < len(l2):\n if l2[j] in l2:\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":29249,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-26 19:23:26","func_code":"def merge_lists(l1, l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n while j < len(l2):\n if l2[j] in l2:\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39254,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-26 19:23:26","func_code":"def weird_case(some_str):\n sent = ''\n i = True\n for words in some_str:\n if i:\n sent += words.upper()\n else:\n sent += words.lower()\n if words != ' ':\n i = not i\n return sent","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20557,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-26 19:23:26","func_code":"def remove_zeros(list):\n value = 0\n while value in list:\n list.remove(value)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":156,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-26 19:23:26","func_code":"def merge_lists(l1, l2):\n i = 0\n j = 0\n l3 = []\n while i < len(l1):\n if l1[i] in l1:\n l3.append(l1[i])\n i = i + 2\n while j < len(l2):\n if l2[j] in l2:\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2594,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-26 19:23:26","func_code":"def remove_zeros(list):\n value = 0\n while value in list:\n list.remove(value)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":38321,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-26 19:23:26","func_code":"def remove_zeros(list):\n value = 0\n while value in list:\n list.remove(value)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":40594,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-26 19:23:26","func_code":"def weird_case(some_str):\n sent = ''\n i = True\n for words in some_str:\n if i:\n sent += words.upper()\n else:\n sent += words.lower()\n if words != ' ':\n i = not i\n return sent","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1578,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-02-26 19:23:26","func_code":"def weird_case(some_str):\n sent = ''\n i = True\n for words in some_str:\n if i:\n sent += words.upper()\n else:\n sent += words.lower()\n if words != ' ':\n i = not i\n return sent","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15126,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:23:58","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l4","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":1918,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:24:13","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30783,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:25:39","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":6868,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:25:39","func_code":"def weird_case(n):\n word = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n letter = word[i]\n x = 0\n while x < len(word):\n if x % 2 == 0 or x == 0:\n letter[x] = letter[x].upper()\n x = x + 1\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39867,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:25:39","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":2978,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:26:26","func_code":"def merge_lists(l1, l2):\n l3 = l2[::2] + l1[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":9032,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:26:26","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n return list.remove('0')\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":25637,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:26:26","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28052,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:27:12","func_code":"def merge_lists(l1, l2):\n l3 = l2[::2] + l1[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":42474,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:27:12","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22131,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:27:12","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n return list.remove('0')\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":24551,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:27:14","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":26506,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:27:14","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":17429,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:27:14","func_code":"def weird_case(n):\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n if x % 2 == 0 or x == 0:\n word[x] = word[x].upper()\n x = x + 1\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3989,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:27:35","func_code":"def weird_case(n):\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n if x % 2 == 0 or x == 0:\n word[x] = str(word[x].upper())\n x = x + 1\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32041,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:27:35","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":27035,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:27:35","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22582,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:27:45","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n return list.remove('0')\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":9939,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:27:45","func_code":"def merge_lists(l1, l2):\n l3 = l2[::2] + l1[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":16491,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:27:45","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37279,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:27:59","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22354,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:27:59","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n return list.remove('0')\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":15361,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:27:59","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l2[::2] + l1[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":26845,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:28:15","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":5826,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:28:15","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n return list.remove('0')\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":4184,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:28:15","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41245,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:29:59","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23780,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:29:59","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33339,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:29:59","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n return list.remove(0)\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":6778,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:30:41","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n list.remove('0')\n return list\n else:\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":18560,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:30:41","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18063,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:30:41","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19387,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:31:05","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n if x % 2 == 0 or x == 0:\n a.append(str(word[x].upper()))\n else:\n a.append(word[x])\n x = x + 1\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14075,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:31:05","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":20521,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:31:05","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":1704,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:31:25","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9002,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:31:25","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n if x % 2 == 0 or x == 0:\n a.append(str(word[x].upper()))\n else:\n a.append(word[x])\n x = x + 1\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11157,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:31:25","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":6956,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:31:26","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":34320,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:31:26","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7677,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 19:31:26","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n list.remove('0')\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24895,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:32:31","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n cap_str = some_str[i].capitalize\n i = i + 2\n return cap_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":41341,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:32:31","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7428,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:32:53","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9863,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:32:53","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":550,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:32:53","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n if x % 2 == 0 or x == 0:\n a.append(str(word[x].upper()))\n else:\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(len(a) - 1)\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27810,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:33:32","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n if x % 2 == 0 or x == 0:\n a.append(str(word[x].upper()))\n else:\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":17967,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:33:32","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":29651,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:33:32","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33480,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:33:54","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":1302,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:33:54","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":30743,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:33:54","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n if x % 2 == 0 or x == 0:\n a.append(str(word[x].upper()))\n else:\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6882,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:34:16","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n if x % 2 == 0 or x == 0:\n a.append(str(word[x].upper()))\n else:\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n print(len(a))\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35040,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:34:16","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23074,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:34:16","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":2991,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:36:56","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15115,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:36:56","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n print(len(a))\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24726,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:36:56","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10486,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:37:47","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(int(len(a) - 1))\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39820,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:37:47","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33742,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:37:47","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40237,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:38:47","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":3879,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:38:47","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[int(len(a) - 1)])","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24350,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:38:47","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":1784,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:39:01","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":30025,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:39:01","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[int(len(a) - 1)])\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6241,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:39:01","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":34536,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:40:23","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36309,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:40:23","func_code":"def weird_case(some_str):\n cap_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str = new_str + letter.upper()\n else:\n new_str = new_str + letter.lower()\n if letter != ' ':\n i = not i\n return cap_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3357,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:40:44","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24646,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:40:44","func_code":"def weird_case(some_str):\n cap_str = ''\n i = True\n for letter in some_str:\n if i:\n new_str = cap_str + letter.upper()\n else:\n new_str = cap_str + letter.lower()\n if letter != ' ':\n i = not i\n return cap_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36732,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:40:55","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[int(len(a) - 1)])\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":17878,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:40:55","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9862,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:40:55","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":25793,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:41:18","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[int(len(a) - 1)])\n print(a)\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32353,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:41:18","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10370,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:41:18","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":35836,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:41:35","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40198,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:41:35","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":30254,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:41:35","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":32712,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:41:47","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11609,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:41:47","func_code":"def weird_case(some_str):\n cap_str = ''\n i = True\n for letter in some_str:\n if i:\n cap_str = cap_str + letter.upper()\n else:\n cap_str = cap_str + letter.lower()\n if letter != ' ':\n i = not i\n return cap_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3319,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:42:20","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":29210,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:42:20","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20230,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:42:20","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":13116,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:42:33","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":39745,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:42:33","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2819,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:42:33","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15606,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:42:48","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38495,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:42:48","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21828,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:42:48","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34138,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:43:02","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9553,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:43:02","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31501,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:43:02","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":39224,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:43:02","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n print(len(a) - 1)\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25096,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:43:02","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30543,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:43:02","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":6847,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:43:36","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23856,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:43:36","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":35021,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:43:36","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.remove(a[len(a) - 1])\n print(a)\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6869,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:44:21","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":10655,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:44:21","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":30105,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:44:21","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n print(a[len(a) - 1])\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13607,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:44:50","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n print(a[len(a) - 1])\n print(a[len(a) - 3])\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26458,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:44:50","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":35124,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:44:50","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10865,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:45:17","func_code":"def weird_case(some_str):\n cap_str = ''\n i = True\n for letter in some_str:\n if i:\n cap_str = cap_str + letter.upper()\n else:\n cap_str = cap_str + letter.lower()\n if letter != ' ':\n i = not i\n return cap_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40634,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:45:17","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":6560,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:45:17","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12969,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:45:22","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15991,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:45:22","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":14657,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:45:22","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n a.pop(a[len(a) - 1])\n print(a[len(a) - 3])\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20404,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:46:01","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38763,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:46:01","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":16095,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:46:01","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n x = []\n x = remove_zeros(x, 0)\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":9951,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:46:06","func_code":"def weird_case(some_str):\n cap_str = ''\n i = True\n for letter in some_str:\n if i:\n cap_str = cap_str + letter.upper()\n else:\n cap_str = cap_str + letter.lower()\n if letter != ' ':\n i = not i\n return cap_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11590,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:46:06","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":11334,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:46:06","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28628,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:46:06","func_code":"def weird_case(some_str):\n cap_str = ''\n i = True\n for letter in some_str:\n if i:\n cap_str = cap_str + letter.upper()\n else:\n cap_str = cap_str + letter.lower()\n if letter != ' ':\n i = not i\n return cap_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8443,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:46:06","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8219,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:46:06","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j = j + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27377,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:46:06","func_code":"def weird_case(some_str):\n cap_str = ''\n i = True\n for letter in some_str:\n if i:\n cap_str = cap_str + letter.upper()\n else:\n cap_str = cap_str + letter.lower()\n if letter != ' ':\n i = not i\n return cap_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26310,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:46:06","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":28043,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-02-26 19:46:06","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":25962,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:46:58","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":36070,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:46:58","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n del a[len(a) - 1]\n print(a)\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10012,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:46:58","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":3342,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:47:05","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":40026,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:47:05","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24148,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:47:05","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n list = remove_zeros(x, 0)\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":20236,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:47:16","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n list = remove_zeros(list, 0)\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":36801,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:47:16","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6644,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:47:16","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2075,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:47:48","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8983,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:47:48","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24935,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:47:48","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n list = list[list != 0]\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":6193,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:48:01","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":29584,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:48:01","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21600,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:48:01","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n del a[len(a) - 1]\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(str(a))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26206,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:48:03","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3718,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:48:03","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19181,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:48:03","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n list = list[list != 0]\n return list\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":11379,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:48:41","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":8293,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:48:41","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":30499,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:48:41","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n del a[len(a) - 1]\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n i = 0\n while i < len(a):\n print(a[i])\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29148,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:50:56","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":22677,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:50:56","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":12887,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:50:56","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n del a[len(a) - 1]\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n i = 0\n while i < len(a):\n print(a[i])\n i = i + 1\n for item in a:\n print(item)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":17367,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:51:18","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":42041,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:51:18","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n del a[len(a) - 1]\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n for item in a:\n print(item)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15916,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:51:18","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":36720,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:52:13","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":1040,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:52:13","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n list.remove('0')\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":34072,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:52:13","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18873,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:53:45","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":6933,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:53:45","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n del a[len(a) - 1]\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31909,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:53:45","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":2748,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:54:47","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":7817,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:54:47","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15018,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:54:47","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n del a[len(a) - 1]\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n i = 0\n while i < len(a):\n \"\"\"\"\"\".append(a[i])\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11060,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:56:01","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n if '0' in list:\n list.remove('0')\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":31484,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:56:01","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7473,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:56:01","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8399,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:56:33","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21718,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:56:33","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":15350,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:56:33","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n while '0' in list:\n list.remove('0')\n if __name__ == '__main__':\n print(\"calling weird_case('change the case')\")\n print(weird_case('change the case'))","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":37686,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:56:46","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n while '0' in list:\n list.remove('0')","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":22310,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:56:46","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28763,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 19:56:46","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1348,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:59:49","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n del a[len(a) - 1]\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(''.join(a))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38935,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:59:49","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":17881,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 19:59:49","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":34690,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:01:01","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":38060,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:01:01","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n zero = '0'\n for x in zero:\n zero.remove(x)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":37061,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:01:01","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":12130,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:01:55","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":28966,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:01:55","func_code":"def weird_case(n):\n a = []\n line = n.strip('\\n').split(' ')\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(' ')\n i = i + 1\n del a[len(a) - 1]\n i = 0\n while i < len(a):\n if i == 0 or i % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(''.join(a).strip('\\n'))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":12860,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:01:55","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":17935,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:03:57","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":34547,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:03:57","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n zero = '0'\n for x in zero:\n zero.pop(x)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":12971,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:03:57","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7338,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-02-26 20:04:17","func_code":"def merge_lists(l1, l2):\n newlist = []\n i = 0\n while i < len(l1):\n newlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n newlist.append(l2[j])\n j = j + 2\n return newlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35682,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:06:33","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":2511,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:06:33","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":19116,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:06:33","func_code":"def weird_case(n):\n A = ' '\n a = []\n line = n.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = 0\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n elif x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(''.join(a).strip)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32687,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:07:26","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":532,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:07:26","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":6853,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:07:26","func_code":"def weird_case(n):\n A = ' '\n a = []\n line = n.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = 0\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n elif x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(''.join(a).strip)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29035,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:07:44","func_code":"def weird_case(n):\n A = ' '\n a = []\n line = n.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = 0\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n elif x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(''.join(a))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13693,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:07:44","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38232,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:07:44","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":8681,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:08:21","func_code":"def weird_case(n):\n A = ' '\n a = []\n line = n.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = 0\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n elif x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(x)\n print(''.join(a))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26645,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:08:21","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":3226,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:08:21","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":28269,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:08:44","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38948,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:08:44","func_code":"def weird_case(n):\n A = ' '\n a = []\n line = n.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = 0\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(x)\n print(''.join(a))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15222,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:08:44","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":37381,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:09:57","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":7784,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:09:57","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24553,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:09:57","func_code":"def weird_case(n):\n A = ' '\n a = []\n line = n.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(x)\n print(''.join(a))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29971,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:10:16","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":35454,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:10:16","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":39285,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:10:16","func_code":"def weird_case(n):\n A = ' '\n a = []\n line = n.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n print(''.join(a))","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33476,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:11:20","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10754,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:11:20","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":14443,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:11:20","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":9115,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:11:20","func_code":"def weird_case(n):\n A = ' '\n a = []\n line = n.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27822,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:11:20","func_code":"def weird_case(n):\n A = ' '\n a = []\n line = n.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":23070,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:11:20","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23411,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:11:20","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":28644,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:11:20","func_code":"def merge_lists(n, m):\n i = 0\n while i < len(m):\n n.append(m[i])\n i = i + 1\n i = 0\n while i < len(n):\n if i % 2 == 1 and i != 0:\n n.remove(n[i])\n i = i + 1\n return n","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31893,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-02-26 20:11:20","func_code":"def weird_case(n):\n A = ' '\n a = []\n line = n.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29600,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:12:48","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append()","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":6614,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:12:48","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37340,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:12:48","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":15625,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:14:03","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31130,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:14:03","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10755,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:14:03","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15217,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:14:36","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1105,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:14:36","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37983,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:14:36","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n lis = list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":13176,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:16:37","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19760,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:16:37","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":819,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:16:37","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n list = lis","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40092,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:16:48","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n list = lis","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":2960,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:16:48","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15735,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:16:48","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":5890,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:17:07","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n list = lis","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":16233,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:17:07","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22663,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:17:07","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2633,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:18:21","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20196,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:18:21","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n list = lis[:]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":16971,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:18:21","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35940,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:18:28","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n list = lis[:]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23677,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:18:28","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":16487,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:18:28","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22952,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:18:47","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n list = lis","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38253,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:18:47","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40960,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:18:47","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26671,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:19:10","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8731,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:19:10","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2900,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:19:10","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n list = lis","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":37978,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:22:51","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39909,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:22:51","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37914,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:22:51","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n for i in range(len(list)):\n list.pop('0')","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":3337,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:23:01","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15412,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:23:01","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31477,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:23:01","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n for i in range(len(list)):\n list.pop(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":16800,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:23:54","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39215,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:23:54","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n lis = list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":22510,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 20:23:54","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37248,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:15:36","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12692,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:15:36","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11714,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:15:36","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n list = lis","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":36774,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:16:26","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18259,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:16:26","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element not in 0:\n lis.append(list)\n list = lis","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":27511,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:16:26","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":15668,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:16:41","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element not in '0':\n lis.append(list)\n list = lis","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":31309,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:16:41","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28261,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:16:41","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33309,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:18:20","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n list = lis","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40792,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:18:20","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n list = lis","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:18:20","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25213,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:18:20","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40814,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:18:20","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n lis = []\n for element in list:\n if element != '0':\n lis.append(list)\n list = lis","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":37900,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:18:20","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4307,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:18:20","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41694,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:18:20","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38618,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-02-26 21:18:20","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":234,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:23:34","func_code":"def weird_case(some_str):\n words = some_str.split()\n string = 1\n some_str = []\n for word in words:\n word = list(word)\n for letter in word:\n if string > 0:\n some_str.append(letter.upper())\n else:\n some_str.append(letter)\n string = -string\n some_str.append(' ')\n string = string\n some_str = ''.join(SoMe_StR[:-1])\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37847,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:23:34","func_code":"def remove_zeros(list):\n i = 0\n while 0 in List:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":11038,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:23:34","func_code":"def merge_lists(l1, l2):\n l3 = []\n merge = 1\n for num in l1:\n if merge > 0:\n l3.append(num)\n merge = -merge\n flip = 1\n for num in l2:\n if merge > 0:\n l3.append(num)\n merge = -merge\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27489,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:24:36","func_code":"def merge_lists(l1, l2):\n l3 = []\n merge = 1\n for num in l1:\n if merge > 0:\n l3.append(num)\n merge = -merge\n flip = 1\n for num in l2:\n if merge > 0:\n l3.append(num)\n merge = -merge\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11678,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:24:36","func_code":"def remove_zeros(list):\n i = 0\n while 0 in List:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":34399,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:24:36","func_code":"def weird_case(some_str):\n words = some_str.split()\n string = 1\n some_str = []\n for word in words:\n word = list(word)\n for letter in word:\n if string > 0:\n some_str.append(letter.upper())\n else:\n some_str.append(letter)\n string = -string\n some_str.append(' ')\n string = string\n some_str = ''.join(SoMe_StR[:-1])\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":5190,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:25:05","func_code":"def remove_zeros(list):\n i = 0\n while 0 in List:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":25994,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:25:05","func_code":"def weird_case(some_str):\n words = some_str.split()\n string = 1\n some_str = []\n for word in words:\n word = list(word)\n for letter in word:\n if string > 0:\n some_str.append(letter.upper())\n else:\n some_str.append(letter)\n string = -string\n some_str.append(' ')\n string = string\n some_str = ''.join(some_str[:-1])\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20406,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:25:05","func_code":"def merge_lists(l1, l2):\n l3 = []\n merge = 1\n for num in l1:\n if merge > 0:\n l3.append(num)\n merge = -merge\n flip = 1\n for num in l2:\n if merge > 0:\n l3.append(num)\n merge = -merge\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36898,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:26:06","func_code":"def weird_case(some_str):\n words = some_str.split()\n string = 1\n some_str = []\n for word in words:\n word = list(word)\n for letter in word:\n if string > 0:\n some_str.append(letter.upper())\n else:\n some_str.append(letter)\n string = -string\n some_str.append(' ')\n string = string\n some_str = ''.join(some_str[:-1])\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39311,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:26:06","func_code":"def remove_zeros(list):\n i = 0\n while i in List:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":24888,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:26:06","func_code":"def merge_lists(l1, l2):\n l3 = []\n merge = 1\n for num in l1:\n if merge > 0:\n l3.append(num)\n merge = -merge\n flip = 1\n for num in l2:\n if merge > 0:\n l3.append(num)\n merge = -merge\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":5118,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:26:27","func_code":"def merge_lists(l1, l2):\n l3 = []\n merge = 1\n for num in l1:\n if merge > 0:\n l3.append(num)\n merge = -merge\n flip = 1\n for num in l2:\n if merge > 0:\n l3.append(num)\n merge = -merge\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31428,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:26:27","func_code":"def remove_zeros(list):\n i = 0\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":22106,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:26:27","func_code":"def weird_case(some_str):\n words = some_str.split()\n string = 1\n some_str = []\n for word in words:\n word = list(word)\n for letter in word:\n if string > 0:\n some_str.append(letter.upper())\n else:\n some_str.append(letter)\n string = -string\n some_str.append(' ')\n string = string\n some_str = ''.join(some_str[:-1])\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27957,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:27:50","func_code":"def merge_lists(l1, l2):\n l3 = []\n merge = 1\n for num in l1:\n if merge > 0:\n l3.append(num)\n merge = -merge\n merge = 1\n for num in l2:\n if merge > 0:\n l3.append(num)\n merge = -merge\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33025,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:27:50","func_code":"def weird_case(some_str):\n words = some_str.split()\n string = 1\n some_str = []\n for word in words:\n word = list(word)\n for letter in word:\n if string > 0:\n some_str.append(letter.upper())\n else:\n some_str.append(letter)\n string = -string\n some_str.append(' ')\n string = string\n some_str = ''.join(some_str[:-1])\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11238,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:27:50","func_code":"def weird_case(some_str):\n words = some_str.split()\n string = 1\n some_str = []\n for word in words:\n word = list(word)\n for letter in word:\n if string > 0:\n some_str.append(letter.upper())\n else:\n some_str.append(letter)\n string = -string\n some_str.append(' ')\n string = string\n some_str = ''.join(some_str[:-1])\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24109,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:27:50","func_code":"def remove_zeros(list):\n i = 0\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40487,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:27:50","func_code":"def remove_zeros(list):\n i = 0\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":30935,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:27:50","func_code":"def remove_zeros(list):\n i = 0\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21873,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:27:50","func_code":"def merge_lists(l1, l2):\n l3 = []\n merge = 1\n for num in l1:\n if merge > 0:\n l3.append(num)\n merge = -merge\n merge = 1\n for num in l2:\n if merge > 0:\n l3.append(num)\n merge = -merge\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12970,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:27:50","func_code":"def weird_case(some_str):\n words = some_str.split()\n string = 1\n some_str = []\n for word in words:\n word = list(word)\n for letter in word:\n if string > 0:\n some_str.append(letter.upper())\n else:\n some_str.append(letter)\n string = -string\n some_str.append(' ')\n string = string\n some_str = ''.join(some_str[:-1])\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36755,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-02-26 21:27:50","func_code":"def merge_lists(l1, l2):\n l3 = []\n merge = 1\n for num in l1:\n if merge > 0:\n l3.append(num)\n merge = -merge\n merge = 1\n for num in l2:\n if merge > 0:\n l3.append(num)\n merge = -merge\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6723,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-02-26 21:53:26","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":38108,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-02-26 21:53:26","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":16376,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-02-26 21:56:54","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if d[k] in new_d:\n del new_d[k]\n else:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":267,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-02-26 21:56:54","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if d[k] in new_d:\n del new_d[k]\n else:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":39149,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-02-26 21:56:54","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if d[k] in new_d:\n del new_d[k]\n else:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":41462,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:13:49","func_code":"def weird_case(some_str):\n new_str = ''\n i = true\n for lett in some_str:\n if i:\n new_str += lett.upper()\n else:\n new_str += lett.lower()\n if lett != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38195,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:13:49","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":12564,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:13:49","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":42424,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:30:38","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3657,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:30:38","func_code":"def weird_case(some_str):\n words = ''\n i = True\n for letter in some_str:\n words += letter.upper() if i else letter.lower()\n if letter.isalpha():\n i = not i\n return words","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36831,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:32:31","func_code":"def weird_case(some_str):\n new_str = ''\n i = true\n for lett in some_str:\n if i:\n new_str += lett.upper()\n else:\n new_str += lett.lower()\n if lett != ' ':\n i = i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39148,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:32:31","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18003,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:32:31","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9328,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-26 22:33:17","func_code":"def remove_zeros(list):\n return [value for value in list if value != 0]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":9256,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-26 22:33:17","func_code":"def remove_zeros(list):\n return [value for value in list if value != 0]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":32858,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-26 22:33:17","func_code":"def remove_zeros(list):\n return [value for value in list if value != 0]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":36037,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:34:17","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for lett in some_str:\n if i:\n new_str += lett.upper()\n else:\n new_str += lett.lower()\n if lett != ' ':\n i = i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20889,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:34:17","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8328,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:34:17","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":33784,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-02-26 22:35:44","func_code":"def swap_keys_values(dict_descriptor):\n new_dict = {}\n for keys, values in list(dict_descriptor.items()):\n new_dict[values] = keys\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":16846,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-02-26 22:35:44","func_code":"def swap_keys_values(dict_descriptor):\n new_dict = {}\n for keys, values in list(dict_descriptor.items()):\n new_dict[values] = keys\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":41385,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:36:34","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":966,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:36:34","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30560,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:36:34","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for lett in some_str:\n if i:\n new_str += lett.upper()\n else:\n new_str += lett.lower()\n if lett != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33458,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:36:34","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":8028,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:36:34","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for lett in some_str:\n if i:\n new_str += lett.upper()\n else:\n new_str += lett.lower()\n if lett != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14290,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:36:34","func_code":"def weird_case(some_str):\n new_str = ''\n i = True\n for lett in some_str:\n if i:\n new_str += lett.upper()\n else:\n new_str += lett.lower()\n if lett != ' ':\n i = not i\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11478,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:36:34","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7261,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:36:34","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21250,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-02-26 22:36:34","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10350,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-02-26 22:41:06","func_code":"def swap_unique_keys_values(dict_descriptor):\n new_dict = {}\n addthosevalues = set()\n for keys, values in list(dict_descriptor.items()):\n if values in new_dict:\n addthosevalues.update([values])\n del new_dict[values]\n elif values not in new_dict:\n new_dict[values] = keys\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":39029,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-02-26 22:41:06","func_code":"def swap_unique_keys_values(dict_descriptor):\n new_dict = {}\n addthosevalues = set()\n for keys, values in list(dict_descriptor.items()):\n if values in new_dict:\n addthosevalues.update([values])\n del new_dict[values]\n elif values not in new_dict:\n new_dict[values] = keys\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":29280,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:46:41","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14374,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:46:41","func_code":"def weird_case(some_str):\n words = ''\n i = True\n for letter in some_str:\n words += letter.upper() if i else letter.lower()\n if letter.isalpha():\n i = not i\n return words","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35047,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:46:41","func_code":"def remove_zeros(list):\n zero = 0\n while zero in list:\n list.remove(zero)\n print(list)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":35443,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:47:25","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22461,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:47:25","func_code":"def weird_case(some_str):\n words = ''\n i = True\n for letter in some_str:\n words += letter.upper() if i else letter.lower()\n if letter.isalpha():\n i = not i\n return words","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13201,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:47:25","func_code":"def remove_zeros(list):\n zero = 0\n while zero in list:\n list.remove(zero)\n print('after calling remove_zeros', list)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":37065,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:48:04","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26852,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:48:04","func_code":"def weird_case(some_str):\n words = ''\n i = True\n for letter in some_str:\n words += letter.upper() if i else letter.lower()\n if letter.isalpha():\n i = not i\n return words","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21383,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:48:04","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39400,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:48:04","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36970,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:48:04","func_code":"def weird_case(some_str):\n words = ''\n i = True\n for letter in some_str:\n words += letter.upper() if i else letter.lower()\n if letter.isalpha():\n i = not i\n return words","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22694,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:48:04","func_code":"def weird_case(some_str):\n words = ''\n i = True\n for letter in some_str:\n words += letter.upper() if i else letter.lower()\n if letter.isalpha():\n i = not i\n return words","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":41775,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:48:04","func_code":"def remove_zeros(list):\n zero = 0\n while zero in list:\n list.remove(zero)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":3846,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:48:04","func_code":"def remove_zeros(list):\n zero = 0\n while zero in list:\n list.remove(zero)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38414,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-02-26 22:48:04","func_code":"def remove_zeros(list):\n zero = 0\n while zero in list:\n list.remove(zero)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":7743,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:28:21","func_code":"def remove_zeros(list):\n for number in list:\n if '0' in list:\n list.remove(0)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":39673,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:28:21","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23431,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:28:21","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35176,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:29:39","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3247,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:29:39","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17850,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:29:39","func_code":"def remove_zeros(list):\n for number in list:\n if number == '0':\n list.remove(0)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":12114,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:30:16","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12440,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:30:16","func_code":"def remove_zeros(list):\n for number in list:\n if number == '0':\n list.remove(number)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":17497,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:30:16","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35345,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:30:42","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18280,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:30:42","func_code":"def remove_zeros(list):\n for number in list:\n if number == '0':\n list.remove(number)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":22518,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:30:42","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10690,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:31:32","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":19754,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:31:32","func_code":"def remove_zeros(list):\n for number in list:\n if number == '0':\n list.remove(list[number])\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":5581,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:31:32","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39490,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:34:22","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28145,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:34:22","func_code":"def remove_zeros(list):\n for number in list:\n if number == '0':\n list.pop(number)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":13305,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:34:22","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14621,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:35:47","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33606,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:35:47","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == '0':\n list.remove(list[i])\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":10778,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:35:47","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8541,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:39:24","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4658,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:39:24","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11179,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:39:24","func_code":"def remove_zeros(list):\n for number in list:\n if number == '0':\n list.remove(number)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":8608,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:40:19","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33033,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:40:19","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37476,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:40:19","func_code":"def remove_zeros(list):\n if '0' in list:\n list.remove('0')","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9011,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:40:48","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30859,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:40:48","func_code":"def remove_zeros(list):\n if '0' in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":15276,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:40:48","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10992,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:41:45","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22587,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:41:45","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":10759,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:41:45","func_code":"def remove_zeros(list):\n if 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23143,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:42:05","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9984,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:42:05","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":560,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:42:05","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26209,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:47:57","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4602,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:47:57","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38341,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:47:57","func_code":"def remove_zeros(list):\n while '0' in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9802,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:48:18","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":30576,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:48:18","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20856,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:48:18","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39229,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:48:18","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":36555,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:48:18","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":1987,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:48:18","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40204,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:48:18","func_code":"def weird_case(some_str):\n i = True\n letter = ''\n for char in some_str:\n if i:\n letter = letter + char.upper()\n else:\n letter = letter + char.lower()\n if char != ' ':\n i = not i\n return letter","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10954,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:48:18","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6394,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-02-26 23:48:18","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":727,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-02-27 00:04:58","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26102,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-02-27 00:04:58","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21724,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-02-27 00:04:58","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 2 == 0:\n sent[i] = sent[i].upper()\n i += 1\n i += 1\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16647,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-02-27 00:04:58","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11134,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-02-27 00:04:58","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 2 == 0:\n sent[i] = sent[i].upper()\n i += 1\n i += 1\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":34907,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-02-27 00:04:58","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9904,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:13","func_code":"def weird_case(some_str):\n diff_str = ''\n i = True\n for letter in a_str:\n if i:\n diff_str += letter.upper()\n else:\n diff_str += letter.lower()\n if letter != ' ':\n i = not i\n return diff_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22418,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:13","func_code":"def merge_lists(l1, l2):\n l = l1[::2] + l2[::2]\n return l","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":16693,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:13","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":962,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:45","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":42397,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:45","func_code":"def weird_case(some_str):\n diff_str = ''\n i = True\n for letter in some_str:\n if i:\n diff_str += letter.upper()\n else:\n diff_str += letter.lower()\n if letter != ' ':\n i = not i\n return diff_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15826,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:45","func_code":"def merge_lists(l1, l2):\n l = l1[::2] + l2[::2]\n return l","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18776,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:45","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":39496,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:45","func_code":"def weird_case(some_str):\n diff_str = ''\n i = True\n for letter in some_str:\n if i:\n diff_str += letter.upper()\n else:\n diff_str += letter.lower()\n if letter != ' ':\n i = not i\n return diff_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1956,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:45","func_code":"def merge_lists(l1, l2):\n l = l1[::2] + l2[::2]\n return l","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23712,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:45","func_code":"def weird_case(some_str):\n diff_str = ''\n i = True\n for letter in some_str:\n if i:\n diff_str += letter.upper()\n else:\n diff_str += letter.lower()\n if letter != ' ':\n i = not i\n return diff_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16204,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:45","func_code":"def merge_lists(l1, l2):\n l = l1[::2] + l2[::2]\n return l","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2183,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-02-27 00:11:45","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":1411,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-02-27 00:12:58","func_code":"def merge_lists(l1, l2):\n list3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n list3.append(l1[i])\n i = i + 1\n k = 0\n while k < len(l2):\n if k % 2 == 0:\n list3.append(l2[k])\n k = k + 1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":41718,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-02-27 00:13:30","func_code":"def merge_lists(l1, l2):\n list3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n list3.append(l1[i])\n i = i + 1\n k = 0\n while k < len(l2):\n if k % 2 == 0:\n list3.append(l2[k])\n k = k + 1\n return list3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":42466,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:04:01","func_code":"def merge_lists(l1, l2):\n i = 0\n k = 0\n l3 = []\n while i < len(l1) or i < len(l2):\n l3.append(l1[k])\n l3.append(l2[k])\n k = k + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":26784,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:05:20","func_code":"def merge_lists(l1, l2):\n i = 0\n k = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[k])\n k = k + 2\n i = 0\n k = 0\n while i < len(l2):\n l3.append(l2[k])\n k = k + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":281,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:06:21","func_code":"def merge_lists(l1, l2):\n i = 0\n k = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[k])\n if len(l1) > 2:\n k = k + 2\n i = 0\n k = 0\n while i < len(l2):\n l3.append(l2[k])\n if len(l2) > 2:\n k = k + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":14678,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:09:14","func_code":"def merge_lists(l1, l2):\n i = 0\n k = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[k])\n k = k + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":38205,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:10:15","func_code":"def merge_lists(l1, l2):\n i = 0\n k = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[k])\n print(i, k)\n k = k + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":27521,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:10:32","func_code":"def merge_lists(l1, l2):\n i = 0\n k = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[k])\n i = i + 1\n k = k + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":17212,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:10:46","func_code":"def merge_lists(l1, l2):\n i = 0\n k = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[k])\n print(i, k)\n i = i + 1\n k = k + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":25748,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:11:27","func_code":"def merge_lists(l1, l2):\n i = 0\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n print(i, k)\n i = i + 1\n k = k + 2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":12943,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:11:55","func_code":"def merge_lists(l1, l2):\n i = 0\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n print(i, k)\n i = i + 1\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":3810,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:12:40","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34123,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:14:20","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24908,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:14:20","func_code":"def weird_case(some_str):\n some_str_split = some_str.list()\n print(some_str_split)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15595,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:14:58","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n print(some_str_split)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24616,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:14:58","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24453,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:17:51","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":29573,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:17:51","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < some_str_split:\n if i % 2 == 0:\n string = string + some_str_split[i].lower()\n else:\n string = string + some_str_split[i].upper()\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33943,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:18:30","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6838,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:18:30","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < some_str_split:\n print(string)\n if i % 2 == 0:\n string = string + some_str_split[i].lower()\n else:\n string = string + some_str_split[i].upper()\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28422,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:18:55","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":1598,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:18:55","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < some_str_split:\n print(string)\n if i % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32222,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:21:35","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28911,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:21:35","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n string = ''\n while i < len(some_str_split):\n print(string)\n if i % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n i = i + 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27517,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:21:54","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":546,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:21:54","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n string = ''\n while i < len(some_str_split):\n if i % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20888,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:23:41","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == true:\n if i % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16145,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:23:41","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8024,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:23:53","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if i % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26162,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:23:53","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8380,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:24:29","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if i % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40287,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:24:29","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30686,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:25:50","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27207,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:25:50","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n k = 0\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21636,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:27:26","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29414,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:27:26","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36114,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:33:18","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":5679,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:33:18","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":15771,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:34:41","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":655,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:34:41","func_code":"def remove_zeros(list):\n print(list)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":26060,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:34:41","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":21149,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:36:39","func_code":"def remove_zeros(list):\n i = 0\n no_zero_list = []\n while i < len(list):\n if list[i] != 0:\n no_zero_list.append(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":32394,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:36:39","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11705,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:36:39","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10391,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:37:26","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25429,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:37:26","func_code":"def remove_zeros(list):\n i = 0\n no_zero_list = []\n while i < len(list):\n if list[i] != 0:\n no_zero_list.append(list[i])\n i = i + 1\n list = no_zero_list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":4885,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:37:26","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40505,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:37:40","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27828,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:37:40","func_code":"def remove_zeros(list):\n i = 0\n no_zero_list = []\n while i < len(list):\n if list[i] != 0:\n no_zero_list.append(list[i])\n i = i + 1\n list = no_zero_list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":8560,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:37:40","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33550,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:38:22","func_code":"def remove_zeros(list):\n i = 0\n no_zero_list = []\n while i < len(list):\n if list[i] != 0:\n no_zero_list.append(list[i])\n i = i + 1\n return no_zero_list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":6110,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:38:22","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13065,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:38:22","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27194,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:39:31","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28348,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:39:31","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1694,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:39:31","func_code":"def remove_zeros(list):\n i = 0\n no_zero_list = []\n while i < len(list):\n if list[i] != 0:\n no_zero_list.append(list[i])\n i = i + 1\n print(list, no_zero_list)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":7217,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:39:41","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4727,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:39:41","func_code":"def remove_zeros(list):\n i = 0\n no_zero_list = []\n while i < len(list):\n if list[i] != 0:\n no_zero_list.append(list[i])\n i = i + 1\n print(no_zero_list)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40476,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:39:41","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33208,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:40:40","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24480,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:40:40","func_code":"def remove_zeros(list):\n i = 0\n no_zero_list = []\n while i < len(list):\n if list[i] != 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":28092,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:40:40","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30821,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:40:51","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37921,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:40:51","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":17051,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:40:51","func_code":"def remove_zeros(list):\n i = 0\n no_zero_list = []\n while i < len(list):\n if list[i] == 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":36889,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:41:27","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19468,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:41:27","func_code":"def remove_zeros(list):\n i = 0\n no_zero_list = []\n while i < len(list):\n if list[i] == 0:\n del list[i]\n i = i + 2\n else:\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":35396,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:41:27","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9323,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:42:08","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11248,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:42:08","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":5162,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:42:08","func_code":"def remove_zeros(list):\n i = 0\n no_zero_list = []\n while i < len(list):\n if list[i] == 0:\n del list[i]\n i = i + 2\n else:\n i = i + 1\n print(i)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21493,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:43:23","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n if temp_list[i] == 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":2054,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:43:23","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21125,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:43:23","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35347,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:44:01","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":17268,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:44:01","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n if temp_list[i] != 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":20645,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:44:01","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":19428,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:44:16","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n if temp_list[i] == 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":26837,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:44:16","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":23508,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:44:16","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":19038,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:46:06","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n if list[i] == 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":30299,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:46:06","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1200,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:46:06","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":10659,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:46:24","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27579,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:46:24","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":262,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:46:24","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[i])\n if list[i] == 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21150,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:47:04","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13896,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:47:04","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32662,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:47:04","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[i])\n if list[i] == '0':\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":16131,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:47:28","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[i])\n if int(list[i]) == 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":29000,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:47:28","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33604,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:47:28","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21036,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:47:45","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":42313,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:47:45","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[i])\n if int(list[i]) == 0:\n del list[i]\n print(list)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21756,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:47:45","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14639,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:48:24","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":16193,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:48:24","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[i])\n if int(list[i]) == 0:\n print(list)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":25789,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:48:24","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40337,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:49:00","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19746,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:49:00","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[i])\n if int(list[i]) == 0:\n list.pop[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":29681,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:49:00","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7427,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:49:52","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[i])\n if int(list[i]) == 0:\n list.pop[0]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":31980,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:49:52","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27009,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:49:52","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":21568,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:51:59","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[i])\n if int(list[i]) == 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":3608,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:51:59","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34367,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:51:59","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32585,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:52:47","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8635,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:52:47","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[i], list, temp_list)\n if int(list[i]) == 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":31674,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:52:47","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14405,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:54:54","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[i], list, temp_list)\n if int(temp_list[i]) == 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":32367,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:54:54","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4606,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:54:54","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41414,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:55:12","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(temp_list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":36083,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:55:12","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":38518,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:55:12","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31768,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:55:49","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n if temp_list[i] == 0:\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":19540,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:55:49","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23174,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:55:49","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10825,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:57:10","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22410,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:57:10","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n if temp_list[i] == 0:\n print(list, temp_list)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":31547,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:57:10","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11357,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:57:36","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n if temp_list[i] == 0:\n list[i].pop\n print(list)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40696,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:57:36","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39167,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:57:36","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13860,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:58:37","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":41613,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:58:37","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26043,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 03:58:37","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n if temp_list[i] == 0:\n print(list, list[i])\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":6286,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:01:14","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39384,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:01:14","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(temp_list[i])\n if temp_list[i] == 0:\n print(list, list[i])\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9905,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:01:14","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":16364,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:01:31","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25238,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:01:31","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31873,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:01:31","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[i])\n if temp_list[i] == 0:\n print(list, list[i])\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":14018,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:01:43","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2185,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:01:43","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7233,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:01:43","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(list[0])\n if temp_list[i] == 0:\n print(list, list[i])\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":7397,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:02:03","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(temp_list[i], i)\n if temp_list[i] == 0:\n print(list, list[i])\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":7389,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:02:03","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10325,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:02:03","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13938,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:03:24","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38861,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:03:24","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9317,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:03:24","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(temp_list[i], i, temp_list)\n if temp_list[i] == 0:\n print(list, list[i])\n del list[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38848,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:05:48","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(temp_list):\n print(temp_list[i], i, temp_list)\n if temp_list[-1] == 0:\n print(list, list[i])\n del list[-1]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":39321,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:05:48","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39274,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:05:48","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12277,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:07:06","func_code":"def remove_zeros(list):\n i = 0\n k = 0\n temp_list = list\n while i < len(temp_list):\n print(temp_list[i], i, temp_list)\n if temp_list[-1 - k] == 0:\n print(list, list[i])\n del list[-1]\n else:\n k = k + 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":8908,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:07:06","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11772,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:07:06","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37766,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:08:52","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n print(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38915,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:08:52","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":41994,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:08:52","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30213,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:10:20","func_code":"def remove_zeros(list):\n i = 0\n temp_list = []\n while i < len(list):\n print(list[i])\n if list[i] == 0:\n del temp_list[i]\n i = i + 1\n list = temp_list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":42309,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:10:20","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33239,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:10:20","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2044,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:10:52","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":34052,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:10:52","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14003,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:10:52","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(list):\n print(list[i])\n if list[i] == 0:\n del temp_list[i]\n i = i + 1\n list = temp_list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23171,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:11:16","func_code":"def remove_zeros(list):\n i = 0\n temp_list = list\n while i < len(list):\n print(list[i])\n if list[i] == 0:\n del temp_list[i]\n print(temp_list)\n i = i + 1\n list = temp_list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":1055,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:11:16","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":42398,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 04:11:16","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14625,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:48:02","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1[i]\n i = i + 2\n j = 0\n merging2 = l2[j]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33849,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:48:02","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":18726,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:48:02","func_code":"def weird_case(some_str):\n ret = ''\n i = True\n for char in some_str:\n if i:\n ret += char.upper()\n else:\n ret += char.lower()\n if char != ' ':\n i = not i\n return ret","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29493,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:48:50","func_code":"def weird_case(some_str):\n ret = ''\n i = True\n for char in some_str:\n if i:\n ret += char.upper()\n else:\n ret += char.lower()\n if char != ' ':\n i = not i\n return ret","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10732,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:48:50","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1[i]\n i = i + 2\n j = 0\n merging2 = l2[j]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":5836,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:48:50","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":31640,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:49:07","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":19454,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:49:07","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1[i]\n i = i + 2\n j = 0\n merging2 = l2[j]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":16889,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:49:07","func_code":"def weird_case(some_str):\n ret = ''\n i = True\n for char in some_str:\n if i:\n ret += char.upper()\n else:\n ret += char.lower()\n if char != ' ':\n i = not i\n return ret","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39856,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:49:07","func_code":"def merge_lists(l1, l2):\n i = 0\n merging1 = l1[i]\n i = i + 2\n j = 0\n merging2 = l2[j]\n j = j + 2\n mergedlist = merging1 + merging2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":712,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:49:07","func_code":"def weird_case(some_str):\n ret = ''\n i = True\n for char in some_str:\n if i:\n ret += char.upper()\n else:\n ret += char.lower()\n if char != ' ':\n i = not i\n return ret","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20779,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-02-27 08:49:07","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":33601,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:03:21","func_code":"def merge_lists(l1, l2):\n l1 = []\n l2 = []\n l4 = l1[::2]\n l5 = l2[::2]\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":19168,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:09:10","func_code":"def merge_lists(l1, l2):\n l1 = []\n l2 = []\n l4 = l1[::2]\n l5 = l2[::2]\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":20407,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:10:34","func_code":"def merge_lists(l1, l2):\n l1 = []\n l2 = []\n l4 = l1[::2]\n l5 = l2[::2]\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":23462,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:11:47","func_code":"def merge_lists(l1, l2):\n l1 = []\n l2 = []\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22132,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:14:10","func_code":"def merge_lists(l1, l2):\n l1 = []\n l2 = l1[::2]\n return l2","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":13207,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:14:43","func_code":"def merge_lists(l1, l2):\n l1 = []\n l3 = l1[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22208,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:17:07","func_code":"def merge_lists(l1, l2):\n l1 = []\n l3 = l1[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":23277,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:21:33","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12573,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:25:20","func_code":"def weird_case(some_str):\n string = some_str.split()\n i = 0\n new_string = []\n while i < len(string):\n j = 0\n word = string[i]\n while j < len(word):\n if j % 2 == 0:\n new_string.append(word[j].upper)\n else:\n new_string.append(word[j])\n return new_string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33776,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:25:41","func_code":"def weird_case(some_str):\n second = some_str[::2]\n weird = second.upper()\n return weird","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28738,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:25:41","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":21926,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:27:40","func_code":"def weird_case(some_str):\n string = some_str.split()\n i = 0\n new_string = []\n while i < len(string):\n j = 0\n word = string[i]\n while j < len(word):\n if j % 2 == 0:\n new_string.append(word[j].upper)\n else:\n new_string.append(word[j])\n return new_string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39647,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:27:40","func_code":"def remove_zeros(list):\n if n in list == 0:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":18782,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:28:21","func_code":"def weird_case(some_str):\n weird = some_str.upper()[::2]\n return weird","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40176,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:28:21","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26227,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:29:19","func_code":"def weird_case(some_str):\n string = some_str.split()\n i = 0\n new_string = []\n while i < len(string):\n j = 0\n word = string[i]\n while j < len(word):\n if j % 2 == 0:\n new_string.append(word[j].upper)\n else:\n new_string.append(word[j])\n return new_string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":38882,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:29:19","func_code":"def remove_zeros(list):\n for n in (list == 0):\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":33184,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:29:21","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":1086,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:29:21","func_code":"def weird_case(some_str):\n weird = some_str.upper()[::2]\n return weird + some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37743,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:31:29","func_code":"def weird_case(some_str):\n second = some_str\n for second[::2] in some_str:\n second.upper()\n return second","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6268,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:31:29","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34446,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:32:33","func_code":"def weird_case(some_str):\n second = some_str\n second.upper()[::2]\n return second","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6650,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:32:33","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2179,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:33:03","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3839,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:33:03","func_code":"def weird_case(some_str):\n second = some_str\n second.upper()[::2]\n return second.upper()[::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21733,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:35:53","func_code":"def remove_zeros(l):\n i = 0\n while i < len(l):\n if l[i] == 0:\n l.delete(i)\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":18184,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:35:53","func_code":"def weird_case(some_str):\n string = some_str.split()\n i = 0\n new_string = []\n while i < len(string):\n j = 0\n word = string[i]\n while j < len(word):\n if j % 2 == 0:\n new_string.append(word[j].upper)\n else:\n new_string.append(word[j])\n return new_string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6538,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:41:36","func_code":"def remove_zeros(l):\n i = 0\n while i < len(l):\n if l[i] == 0:\n l.pop()\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":14497,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:41:36","func_code":"def remove_zeros(l):\n i = 0\n while i < len(l):\n if l[i] == 0:\n l.pop()\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21381,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:41:36","func_code":"def remove_zeros(l):\n i = 0\n while i < len(l):\n if l[i] == 0:\n l.pop()\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":22049,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:41:36","func_code":"def weird_case(some_str):\n string = some_str.split()\n i = 0\n new_string = []\n while i < len(string):\n j = 0\n word = string[i]\n while j < len(word):\n if j % 2 == 0:\n new_string.append(word[j].upper)\n else:\n new_string.append(word[j])\n return new_string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39325,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:41:36","func_code":"def weird_case(some_str):\n string = some_str.split()\n i = 0\n new_string = []\n while i < len(string):\n j = 0\n word = string[i]\n while j < len(word):\n if j % 2 == 0:\n new_string.append(word[j].upper)\n else:\n new_string.append(word[j])\n return new_string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33263,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-02-27 09:41:36","func_code":"def weird_case(some_str):\n string = some_str.split()\n i = 0\n new_string = []\n while i < len(string):\n j = 0\n word = string[i]\n while j < len(word):\n if j % 2 == 0:\n new_string.append(word[j].upper)\n else:\n new_string.append(word[j])\n return new_string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6684,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:42:55","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22750,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:42:55","func_code":"def weird_case(some_str):\n i = 0\n each_word = some_str.split(' ')\n second_word = each_word[::2]\n upper_case = second_word.upper()\n return ' '.join(some.string)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15358,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:43:30","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37668,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:43:30","func_code":"def weird_case(some_str):\n i = 0\n each_word = some_str.split(' ')\n upper_case = second_word.upper()[::2]\n return ' '.join(some.string)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":30457,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:43:52","func_code":"def weird_case(some_str):\n i = 0\n each_word = some_str.split(' ')\n upper_case = each_word.upper()[::2]\n return ' '.join(some.string)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27892,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:43:52","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34444,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:46:48","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n word = some_str.split()\n for word[::2] in some_str:\n upper_case = word.upper()\n print(some_str)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22148,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:46:48","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2429,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:47:19","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":10036,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:47:19","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n word = some_str\n for word[::2] in some_str:\n upper_case = word.upper()\n print(some_str)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35632,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:52:29","func_code":"def weird_case(some_str):\n i = 0\n upper_case = some_str.split()[::2]\n print(upper_case)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4375,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:52:29","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31357,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:53:08","func_code":"def weird_case(some_str):\n i = 0\n upper_case = some_str.upper()[::2]\n print(upper_case)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8871,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:53:08","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11692,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:53:22","func_code":"def weird_case(some_str):\n i = 0\n upper_case = some_str.upper()[::2]\n return upper_case","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26048,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:53:22","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":38287,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:57:51","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20754,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 09:57:51","func_code":"def weird_case(some_str):\n i = 0\n a = some_str.split(' ')\n l = []\n for word in a:\n if i:\n l.append(word.upper())\n else:\n l.append(word)\n i = int(not i)\n return ' '.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28436,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:01:55","func_code":"def weird_case(some_str):\n i = 0\n a = some_str[::2]\n l = []\n for word in a:\n if i:\n l.append(word.upper())\n else:\n l.append(word)\n i = int(not i)\n return ' '.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36941,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:01:55","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28634,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:05:15","func_code":"def weird_case(some_str):\n str = ''\n i = 0\n for char in some_str:\n if i:\n str += char.upper()\n else:\n str += char.lower()\n return str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":9074,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:05:15","func_code":"def remove_zeros(list):\n remove[0].list\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":26654,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:05:15","func_code":"def merge_lists(l1, l2):\n merged = l1[::2] + l2[::2]\n return merged","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14218,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:06:07","func_code":"def remove_zeros(list):\n remove[0].list\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":31708,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:06:07","func_code":"def weird_case(some_str):\n str = ''\n i = 0\n for char in some_str:\n if i:\n str += char.upper()\n else:\n str += char.lower()\n return str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27435,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:06:07","func_code":"def merge_lists(l1, l2):\n merged = l1[::2] + l2[::2]\n return merged","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":948,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:06:50","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20165,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:06:50","func_code":"def weird_case(some_str):\n word = some_str.split()\n word.upper()[::2]\n return word","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15560,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:07:05","func_code":"def merge_lists(l1, l2):\n merged = l1[::2] + l2[::2]\n return merged","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8462,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:07:05","func_code":"def weird_case(some_str):\n str = ''\n i = 0\n for char in some_str:\n if i:\n str += char.upper()\n else:\n str += char.lower()\n return str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2530,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:07:05","func_code":"def remove_zeros(list):\n remove[0].list\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":14869,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:09:12","func_code":"def merge_lists(l1, l2):\n merged = l1[::2] + l2[::2]\n return merged","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41773,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:09:12","func_code":"def remove_zeros(list):\n remove[0].list\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":25861,"user":"2c13dbec-3676-4a81-84ae-11e26467d09e","date":"2018-02-27 10:09:12","func_code":"def weird_case(some_str):\n str = ''\n i = 0\n for char in some_str:\n if i:\n str += char.upper()\n else:\n str += char.lower()\n return str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":5408,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:11:41","func_code":"def weird_case(some_str):\n some_str = some_str.split().upper()\n i = 0\n while i < len(some_str):\n print(some_str)\n i = 0\n a = some_str.split(' ')\n l = []\n for word in a:\n if i:\n l.append(word.upper())\n else:\n l.append(word)\n i = int(not i)\n return ' '.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6994,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:11:41","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35029,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:12:01","func_code":"def weird_case(some_str):\n some_str = some_str.split().upper()\n i = 0\n while i < len(some_str):\n return some_str\n i = 0\n a = some_str.split(' ')\n l = []\n for word in a:\n if i:\n l.append(word.upper())\n else:\n l.append(word)\n i = int(not i)\n return ' '.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24036,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:12:01","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33028,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-27 10:12:03","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n i = 0\n while i < len(d):\n values.append(d[i])\n for key in d:\n if values.count(d[key]) == 1:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":39478,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-27 10:13:03","func_code":"def swap_unique_keys_values(d):\n keys = []\n values = []\n for value in d:\n values.append(d[value])\n for key in d:\n if values.count(d[key]) == 1:\n keys.append(key)\n values.append(d[key])\n new = {}\n i = 0\n while i < len(keys):\n val = values[i]\n key = keys[i]\n new[val] = key\n i = i + 1\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":20041,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:14:48","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n word = some_str.split()\n for word[::2] in some_str:\n upper_case = word.upper()","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10352,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:14:48","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31269,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-27 10:16:08","func_code":"def merge_lists(l1, l2):\n number = []\n i = 0\n while i < len(l1):\n number.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n number.append(l2[j])\n j = j + 2\n return number","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31227,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-27 10:16:08","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n elif a[i] == 0:\n del a[i]\n i = i + 1\n return a","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":11305,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:16:08","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36301,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:16:08","func_code":"def weird_case(some_str):\n each_word = some_str.split(' ')\n each_word.upper()[::2]\n return each_word","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13196,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-27 10:16:30","func_code":"def merge_lists(l1, l2):\n number = []\n i = 0\n while i < len(l1):\n number.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n number.append(l2[j])\n j = j + 2\n return number","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":29046,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-27 10:16:30","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1\n return a","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":9312,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-27 10:16:30","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1\n return a","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":11911,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-27 10:16:30","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1\n return a","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":31928,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-27 10:16:30","func_code":"def merge_lists(l1, l2):\n number = []\n i = 0\n while i < len(l1):\n number.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n number.append(l2[j])\n j = j + 2\n return number","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4692,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-02-27 10:16:30","func_code":"def merge_lists(l1, l2):\n number = []\n i = 0\n while i < len(l1):\n number.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n number.append(l2[j])\n j = j + 2\n return number","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24530,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:17:37","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":16550,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:17:37","func_code":"def weird_case(some_str):\n second = some_str\n second.upper()[::2]\n return second","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36745,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:18:23","func_code":"def weird_case(some_str):\n second = some_str\n for some_str[::2] in some_str:\n weird = some_str.upper()[::2]\n return weird + some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4682,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:18:23","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27097,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:18:58","func_code":"def weird_case(some_str):\n weird = some_str.upper()[::2]\n return weird + some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":23367,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:18:58","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8172,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:20:15","func_code":"def remove_zeros(list):\n return [value for value in list if value != 0]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":25753,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:20:15","func_code":"def merge_lists(l1, l2):\n l3 = []","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":3000,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:20:41","func_code":"def remove_zeros(list):\n return [value for value in list if value != 0]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":28872,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:20:41","func_code":"def merge_lists(l1, l2):\n l3 = []","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":14281,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:20:59","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31174,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:20:59","func_code":"def weird_case(some_str):\n weird = some_str.upper()[::2]\n return weird","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29866,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:22:33","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in l1:\n l3.append(l1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":24017,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:22:51","func_code":"def remove_zeros(list):\n return [value for value in list if value != 0]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":18196,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:22:51","func_code":"def merge_lists(l1, l2):\n l3 = []","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":37959,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:22:53","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":41542,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:23:52","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n return l3[2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":39599,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:24:02","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in l1:\n i = 0\n while i < len(l1):\n if i == 0 or i % 2 == 0:\n l3.append(l1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":20039,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:24:39","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in l1:\n i = 0\n while i < len(l1):\n if i == 0 or i % 2 == 0:\n l1.append(l3)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":388,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:25:43","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9381,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:25:43","func_code":"def weird_case(some_str):\n i = 0\n a = s.split(' ')\n l = []\n for word in a:\n if i:\n l.append(word.upper()[::2])\n else:\n l.append(word)\n i = int(not i)\n return ' '.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22164,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:25:45","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in l1:\n i = 0\n while i < len(l1):\n if i == 0 or i % 2 == 0:\n l3.append(l1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":40211,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:26:01","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25025,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:26:01","func_code":"def weird_case(some_str):\n i = 0\n a = s.split(' ')\n l = []\n for word in a:\n if i:\n l.append(word.upper()[::2])\n else:\n l.append(word)\n i = int(not i)\n return ' '.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32462,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:26:09","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in l1:\n i = 0\n while i < len(l1):\n if i == 0 or i % 2 == 0:\n l3.pop(l1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":11587,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:26:14","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":3025,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:26:24","func_code":"def weird_case(some_str):\n i = 0\n a = some_str.split(' ')\n l = []\n for word in a:\n if i:\n l.append(word.upper()[::2])\n else:\n l.append(word)\n i = int(not i)\n return ' '.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10344,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:26:24","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35019,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:27:42","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in l1:\n i = 0\n while i < len(l1):\n if i == 0 or i % 2 == 0:\n l3.append(l1[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":16710,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:28:04","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in l1:\n i = 0\n while i < len(l1):\n if i == 0 and i % 2 == 0:\n l3.append(l1[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":38909,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:28:13","func_code":"def weird_case(some_str):\n i = 0\n a = some_str\n l = []\n for word in a:\n if i:\n l.append(word.upper()[::2])\n else:\n l.append(word)\n i = int(not i)\n return ' '.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31186,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:28:13","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":5625,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:28:13","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in l1:\n i = 0\n while i < len(l1):\n if i == 0 or i % 2 == 0:\n l3.append(l1[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":41398,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:28:23","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 2 == 0:\n sent[i] = sent[i].upper()\n i += 1\n i += 1\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15368,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:28:23","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":15644,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:28:23","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34570,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:29:11","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27375,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:29:11","func_code":"def weird_case(some_str):\n i = 0\n a = some_str\n l = []\n for word in a:\n if i:\n l.append(word.upper()[::2])\n else:\n l.append(word)\n i = int(not i)\n return ''.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14438,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:30:27","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in l1:\n i = 0\n while i <= len(l1):\n if i == 0 or i % 2 == 0:\n l3.append(l1[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":11949,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:30:37","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in l1:\n i = 0\n while i < len(l1):\n if i == 0 or i % 2 == 0:\n l3.append(l1[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":2157,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:31:55","func_code":"def weird_case(some_str):\n i = 0\n a = some_str\n l = []\n if i:\n l.append(word.upper()[::2])\n else:\n l.append(word)\n i = int(not i)\n return ''.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21456,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:31:55","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18445,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:32:28","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 2 == 0:\n sent[i] = sent[i].upper()\n i += 1\n i += 1\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40110,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:32:28","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":19368,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:32:28","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36747,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:32:51","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22288,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:32:51","func_code":"def weird_case(some_str):\n i = 0\n a = some_str\n l = []\n for word in a:\n if i:\n l.append(word.upper()[::2])\n else:\n l.append(word)\n i = int(not i)\n return ''.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":30549,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:32:54","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":4926,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:33:37","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in l1:\n l3.append(l1)\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":27410,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:34:12","func_code":"def weird_case(some_str):\n i = 0\n a = some_str\n l = []\n for word in a:\n if i:\n l.append(word.upper()[::2])\n else:\n l.append(word)\n i = int(not i)\n return ''.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":42430,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:34:12","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2354,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:34:39","func_code":"def weird_case(some_str):\n i = 0\n a = some_str\n l = []\n for word in a:\n if i:\n l.append(word.upper()[::2])\n else:\n l.append(word)\n return ''.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33481,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:34:39","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7271,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:34:59","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9376,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:34:59","func_code":"def weird_case(some_str):\n i = 0\n a = some_str\n l = []\n for word in a:\n if i:\n l.append(word.upper()[::2])\n i = int(not i)\n return ''.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26706,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:35:55","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":13187,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:35:55","func_code":"def weird_case(some_str):\n if some_str[2].upper:\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4235,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:36:10","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30737,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:36:10","func_code":"def weird_case(some_str):\n i = 0\n a = some_str\n l = []\n for word in a:\n if i:\n l.append(word[::2])\n else:\n l.append(word)\n i = int(not i)\n return ''.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10093,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:36:27","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39431,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:36:27","func_code":"def weird_case(some_str):\n i = 0\n a = some_str\n l = []\n for word in a:\n if i:\n l.append(word[::2].upper())\n else:\n l.append(word)\n i = int(not i)\n return ''.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14806,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:36:33","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":17392,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:36:33","func_code":"def weird_case(some_str):\n if some_str.upper:\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35535,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:36:37","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 1:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if i % 2 == 1:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":460,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:36:37","func_code":"def remove_zeros(list):\n return [value for value in list if value != 0]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":40126,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:36:46","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":21365,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:36:46","func_code":"def weird_case(some_str):\n i = 0\n a = some_str\n l = []\n for word in a:\n if i:\n l.append(word[:2].upper())\n else:\n l.append(word)\n i = int(not i)\n return ''.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":9044,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:36:56","func_code":"def merge_lists(l1, l2):\n for lines in (l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35071,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:37:05","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3866,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:37:07","func_code":"def weird_case(some_str):\n i = 0\n a = some_str\n l = []\n for word in a:\n if i:\n l.append(word[::2].upper())\n else:\n l.append(word)\n i = int(not i)\n return ''.join(l)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":41239,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:37:07","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20454,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:37:10","func_code":"def remove_zeros(list):\n return [value for value in list if value != 0]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":17496,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:37:10","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if i % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":39086,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:37:13","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in (l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25955,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:37:34","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":827,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:37:50","func_code":"def weird_case(some_str):\n A = ' '\n some_str = input().upper()\n parse = A.join(some_str).split()\n sentence = ''\n a = ''\n b = []\n j = 0\n while j < len(some_str):\n if some_str[j] == A:\n b.append(j)\n j = j + 1\n i = 0\n while i < len(parse):\n if i % 2 == 0:\n a += parse[i]\n elif i % 2 != 0:\n a += parse[i].lower()\n i = i + 1\n counter = 0\n k = 0\n while k < len(a):\n sentence += a[k]\n if b[0] == k + 1:\n sentence += A\n if b[1] == k + 2:\n sentence += A\n k = k + 1\n print(sentence)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13408,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:37:50","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31028,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:37:50","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":20084,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:37:58","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i += 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":40658,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:37:58","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":12329,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:37:58","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if dentence[i].isalpha() and i % 2 == 0:\n sentence[i] = sent[i].upper()\n i += 1\n i += 1\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22983,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:38:02","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if i % 2 == 1:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":30381,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:38:02","func_code":"def remove_zeros(list):\n return [value for value in list if value != 0]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":16966,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:38:17","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26193,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-02-27 10:39:04","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":24780,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-02-27 10:39:04","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":21982,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-02-27 10:39:04","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":37046,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:39:10","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in (l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9193,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:39:10","func_code":"def weird_case(some_str):\n some_str = input()\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40166,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:39:48","func_code":"def weird_case(some_str):\n string = input()\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4237,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:39:48","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in (l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23859,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:40:24","func_code":"def remove_zeros(list):\n return [value for value in list if value != 0]","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":4177,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:40:24","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31695,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:41:02","func_code":"def weird_case(some_str):\n weird_case = str\n i = 0\n while i < len(some_str):\n weird_case = some_str.uppercase()\n i = i + 2","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14932,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:41:02","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33756,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:41:27","func_code":"def weird_case(some_str):\n weird_case = str\n i = 0\n while i < len(some_str):\n weird_case = some_str.uppercase()\n i = i + 2\n return weird_case","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11955,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:41:27","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20581,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:41:45","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in (l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":19602,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:41:45","func_code":"def weird_case(some_str):\n string = input()\n word = []\n word.append(string)\n return word","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22328,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:42:04","func_code":"def weird_case(some_str):\n A = ' '\n some_str = input().upper()\n parse = A.join(some_str).split()\n sentence = ''\n a = ''\n b = []\n j = 0\n while j < len(some_str):\n if some_str[j] == A:\n b.append(j)\n j = j + 1\n i = 0\n while i < len(parse):\n if i % 2 == 0:\n a += parse[i]\n elif i % 2 != 0:\n a += parse[i].lower()\n i = i + 1\n counter = 0\n k = 0\n while k < len(a):\n sentence += a[k]\n if b[0] == k + 1:\n sentence += A\n if b[1] == k + 2:\n sentence += A\n k = k + 1\n return sentence","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31041,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:42:04","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21578,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:42:04","func_code":"def weird_case(some_str):\n A = ' '\n some_str = input().upper()\n parse = A.join(some_str).split()\n sentence = ''\n a = ''\n b = []\n j = 0\n while j < len(some_str):\n if some_str[j] == A:\n b.append(j)\n j = j + 1\n i = 0\n while i < len(parse):\n if i % 2 == 0:\n a += parse[i]\n elif i % 2 != 0:\n a += parse[i].lower()\n i = i + 1\n counter = 0\n k = 0\n while k < len(a):\n sentence += a[k]\n if b[0] == k + 1:\n sentence += A\n if b[1] == k + 2:\n sentence += A\n k = k + 1\n return sentence","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10305,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:42:04","func_code":"def weird_case(some_str):\n A = ' '\n some_str = input().upper()\n parse = A.join(some_str).split()\n sentence = ''\n a = ''\n b = []\n j = 0\n while j < len(some_str):\n if some_str[j] == A:\n b.append(j)\n j = j + 1\n i = 0\n while i < len(parse):\n if i % 2 == 0:\n a += parse[i]\n elif i % 2 != 0:\n a += parse[i].lower()\n i = i + 1\n counter = 0\n k = 0\n while k < len(a):\n sentence += a[k]\n if b[0] == k + 1:\n sentence += A\n if b[1] == k + 2:\n sentence += A\n k = k + 1\n return sentence","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10950,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:42:04","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2150,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:42:04","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39813,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:42:04","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in (l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39395,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:42:04","func_code":"def weird_case(some_str):\n string = input()\n word = []\n word.append(string)\n return word[::2]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31525,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:42:04","func_code":"def merge_lists(l1, l2):\n a = []\n i = 0\n while i < len(l1):\n a.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n a.append(l2[j])\n j = j + 2\n return a","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":42360,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:42:04","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":30975,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-02-27 10:42:04","func_code":"def remove_zeros(a):\n i = 0\n while i < len(a):\n if a[i] == 0:\n del a[i]\n if a[i] == 0:\n del a[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":12932,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:43:27","func_code":"def weird_case(some_str):\n weird_str = str(some_str.uppercase())\n i = 0\n while i < len(some_str):\n weird_str = some_str.uppercase()\n i = i + 2\n return weird_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16343,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:43:27","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":38389,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:43:35","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":28538,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:43:43","func_code":"def weird_case(some_str):\n weird_str = str(some_str)\n i = 0\n while i < len(some_str):\n weird_str = some_str.uppercase()\n i = i + 2\n return weird_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":7738,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:43:43","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14222,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:43:59","func_code":"def weird_case(some_str):\n some_str = some_str.upper()","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27722,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:43:59","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25120,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:44:16","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20081,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:44:16","func_code":"def weird_case(some_str):\n some_str = some_str.upper()\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40958,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 10:44:29","func_code":"def swap_keys_values(d):\n for k, v in list(d.items()):\n k, v = v, k\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":7669,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:44:39","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in (l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22395,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:44:39","func_code":"def weird_case(some_str):\n weird_case = input()\n return weird_case","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16916,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:44:50","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30089,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:44:50","func_code":"def weird_case(some_str):\n some_str = str(some_str)\n i = 0\n while i < len(some_str):\n some_str = some_str.uppercase()\n i = i + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14699,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:45:16","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n return l1\n i = i + 1\n while i < len(l2):\n return l2\n i = i + 1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":6326,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:45:27","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":17552,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:45:27","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sentence = list(some_str)\n i = 0\n while i < len(sentence):\n if sentence[i].isalpha() and i % 2 == 0:\n sentence[i] = sentence[i].upperCase()\n i = i + 1\n i = i + 1\n return sentence","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8320,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:45:27","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i += 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":40041,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:45:38","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9986,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:45:38","func_code":"def remove_zeros(list):\n i = 0\n if list[i] == 0:\n del list[i]\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":29403,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:45:41","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sentence = list(some_str)\n i = 0\n while i < len(sentence):\n if sentence[i].isalpha() and i % 2 == 0:\n sentence[i] = sentence[i].upper()\n i = i + 1\n i = i + 1\n return sentence","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3868,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:45:41","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i += 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":19083,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:45:41","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":13328,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:45:57","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n return l1\n i = i + 1\n while i < len(l2):\n return l2\n i = i + 1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":32192,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 10:46:29","func_code":"def swap_keys_values(d):\n return d((v, k) for k, v in d.items())","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":24694,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:47:01","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":36090,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:47:01","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i += 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37177,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:47:01","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sentence = list(some_str).split()\n i = 0\n while i < len(sentence):\n if sentence[i].isalpha() and i % 2 == 0:\n sentence[i] = sentence[i].upper()\n i = i + 1\n i = i + 1\n return sentence","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":37422,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 10:47:21","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":12940,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 10:47:21","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":40687,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:47:27","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6972,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:47:27","func_code":"def weird_case(some_str):\n weird_str = []\n i = 0\n while i < len(weird_str):\n weird_str = some_str.uppercase()\n i = i + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40765,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:47:33","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sentence = list(some_str)\n i = 0\n while i < len(sentence):\n if sentence[i].isalpha() and i % 2 == 0:\n sentence[i] = sentence[i].upper()\n i = i + 1\n i = i + 1\n return sentence","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32969,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:47:33","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i += 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8726,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:47:57","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":1688,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:47:57","func_code":"def weird_case(some_str):\n weird_str = []\n i = 0\n while i < len(weird_str):\n weird_str = some_str.uppercase()\n i = i + 2\n return weird_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4421,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:48:12","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41104,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:48:12","func_code":"def weird_case(some_str):\n weird_str = some_str\n i = 0\n while i < len(weird_str):\n weird_str = some_str.uppercase()\n i = i + 2\n return weird_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13074,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:49:07","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41653,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:49:07","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str = some_str.uppercase()\n i = i + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15367,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:49:16","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6598,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:49:16","func_code":"def weird_case(some_str):\n some_str = some_str.upper()\n for word in some_str:\n if word % 2 == 0:\n word.lower()\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32492,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:49:16","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n return l1[i]\n i = i + 1\n while i < len(l2):\n return l2[i]\n i = i + 1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":32912,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:49:32","func_code":"def remove_zeros(list):\n i = 0\n if list[i] == '0':\n del list[i]\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":31652,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:49:32","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18039,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:49:39","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":4810,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:49:39","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33888,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:49:49","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18133,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:49:49","func_code":"def weird_case(some_str):\n some_str = str\n i = 0\n while i < len(some_str):\n some_str = some_str.uppercase()\n i = i + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":12450,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:49:49","func_code":"def weird_case(some_str):\n some_str = str\n i = 0\n while i < len(some_str):\n some_str = some_str.uppercase()\n i = i + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40132,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:49:49","func_code":"def weird_case(some_str):\n some_str = str\n i = 0\n while i < len(some_str):\n some_str = some_str.uppercase()\n i = i + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":34104,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:49:49","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7731,"user":"6aa0e790-273f-4239-98eb-0b504997b70b","date":"2018-02-27 10:49:49","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i = i + 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11954,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:49:59","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41118,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:49:59","func_code":"def weird_case(some_str):\n some_str = some_str.upper()\n for word in some_str:\n if int(word % 2 == 0):\n word.lower()\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11067,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:50:11","func_code":"def remove_zeros(list):\n i = 0\n if str(list[i]) == '0':\n del list[i]\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":11481,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:50:11","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26774,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:50:32","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sentence = list(some_str)\n i = 0\n while i < len(sentence):\n if sentence[i].isalpha() and i % 2 == 0:\n sentence[i] = sentence[i].upper()\n i = i + 1\n return sentence","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40284,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:50:32","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i += 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":16847,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:51:02","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i += 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39055,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:51:02","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sentence = list(some_str)\n i = 0\n while i < len(sentence):\n if sentence[i].isalpha() and i % 2 == 0:\n sentence[i] = sentence[i].upper()\n i = i + 1\n return sentence.join()","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27081,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:51:21","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24913,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:51:21","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":6412,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:51:33","func_code":"def weird_case(some_str):\n some_str = some_str.upper()\n for word[::2] in some_str:\n word.lower()\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":125,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:51:33","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17593,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:51:50","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i += 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2908,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:51:50","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sentence = list(some_str)\n i = 0\n while i < len(sentence):\n if sentence[i].isalpha() and i % 2 == 0:\n sentence[i] = sentence[i].upper()\n i = i + 1\n return join(sentence)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29307,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-02-27 10:53:14","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = []\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n j = 0\n while j < len(l2):\n l3.append(l2[j])\n j += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":35497,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-02-27 10:53:14","func_code":"def weird_case(some_str, some_string):\n v = 0\n str = []\n while v < len(some_str):\n str.upper(some_str[v])\n v += 2\n w = 0\n while w < len(some_string):\n str.lower(some_string)\n w += 2\n return str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":34557,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:53:20","func_code":"def remove_zeros(list):\n i = 0\n for value in list:\n if value == 0:\n del value\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":519,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 10:53:20","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30008,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:53:31","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i += 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33121,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:53:31","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sentence = list(some_str)\n i = 0\n while i < len(sentence):\n if sentence[i].isalpha() and i % 2 == 0:\n sentence[i] = sentence[i].upper()\n i = i + 1\n return sentence","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28984,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:53:31","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sentence = list(some_str)\n i = 0\n while i < len(sentence):\n if sentence[i].isalpha() and i % 2 == 0:\n sentence[i] = sentence[i].upper()\n i = i + 1\n return sentence","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16652,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:53:31","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i += 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25964,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:53:31","func_code":"def merge_lists(l1, l2):\n list = []\n i = 0\n while i < len(l1):\n list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n list.append(l2[i])\n i += 2\n return list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":16912,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-02-27 10:53:31","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sentence = list(some_str)\n i = 0\n while i < len(sentence):\n if sentence[i].isalpha() and i % 2 == 0:\n sentence[i] = sentence[i].upper()\n i = i + 1\n return sentence","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14817,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:53:59","func_code":"def remove_zeros(listy):\n i = 0\n for numbers in listy:\n if 0 in listy:\n listy.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":4600,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 10:53:59","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in (l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35125,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:55:18","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":40329,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 10:55:18","func_code":"def remove_zeros(list):\n value = 0\n while value in list:\n list.remove(value)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":23904,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 10:55:18","func_code":"def remove_zeros(list):\n value = 0\n while value in list:\n list.remove(value)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":2824,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 10:55:18","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24378,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 10:55:18","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35580,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 10:55:18","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":21888,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 10:55:18","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39424,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:55:18","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31624,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 10:55:18","func_code":"def remove_zeros(list):\n value = 0\n while value in list:\n list.remove(value)\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":15843,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 10:55:18","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":32554,"user":"557b99ed-3c48-4070-b887-de4b2d06ac8d","date":"2018-02-27 10:55:18","func_code":"def merge_lists(l1, l2):\n k = 0\n l3 = []\n while k < len(l1):\n l3.append(l1[k])\n k = k + 2\n k = 0\n while k < len(l2):\n l3.append(l2[k])\n k = k + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6418,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:55:22","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[2])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[2])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":30368,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:55:29","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18634,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:55:29","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":18407,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:55:29","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38953,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:55:29","func_code":"def weird_case(some_str):\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":42111,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:55:29","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":19268,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:55:29","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":123,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:55:29","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27423,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:55:29","func_code":"def weird_case(some_str):\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31634,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-02-27 10:55:29","func_code":"def weird_case(some_str):\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3448,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:55:43","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":5778,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2018-02-27 10:56:06","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str[i] = some_str[i].upper()\n i = i + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4838,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2018-02-27 10:56:06","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n l4 = []\n i = 0\n while i < len(l3):\n l4.append(l3[i])\n i = i + 2\n return l4","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26704,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 10:56:32","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])[2]\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])[2]\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33847,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2018-02-27 10:57:09","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n l4 = []\n i = 0\n while i < len(l3):\n l4.append(l3[i])\n i = i + 2\n return l4","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23010,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2018-02-27 10:57:09","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str[i].upper()\n i = i + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19899,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2018-02-27 10:57:09","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n l4 = []\n i = 0\n while i < len(l3):\n l4.append(l3[i])\n i = i + 2\n return l4","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6652,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2018-02-27 10:57:09","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str[i].upper()\n i = i + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":17527,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2018-02-27 10:57:09","func_code":"def merge_lists(l1, l2):\n l3 = l1 + l2\n l4 = []\n i = 0\n while i < len(l3):\n l4.append(l3[i])\n i = i + 2\n return l4","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11610,"user":"b9519383-96f3-4fcc-b33f-df67f186ba78","date":"2018-02-27 10:57:09","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n some_str[i].upper()\n i = i + 2\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2560,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-27 10:57:23","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":4013,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-27 10:57:23","func_code":"def weird_case(some_str):\n new_str = ''\n capital = True\n for value in some_str:\n if capital:\n new_str = new_str + value.upper()\n else:\n new_str = new_str + value\n if value != ' ':\n capital = not capital\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32100,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-27 10:57:23","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27497,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-27 10:57:23","func_code":"def weird_case(some_str):\n new_str = ''\n capital = True\n for value in some_str:\n if capital:\n new_str = new_str + value.upper()\n else:\n new_str = new_str + value\n if value != ' ':\n capital = not capital\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11109,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-27 10:57:23","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":3725,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-27 10:57:23","func_code":"def weird_case(some_str):\n new_str = ''\n capital = True\n for value in some_str:\n if capital:\n new_str = new_str + value.upper()\n else:\n new_str = new_str + value\n if value != ' ':\n capital = not capital\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35499,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-27 10:57:23","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39571,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-27 10:57:23","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8663,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-02-27 10:57:23","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":12294,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:58:09","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14000,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:58:09","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":32760,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:58:09","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":15364,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:58:37","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30868,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 10:59:18","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22399,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 10:59:20","func_code":"def swap_unique_keys_values(d):\n d = {v: k for k, v in list(d.items())}\n new_d = {}\n for k, v in d:\n if k not in new_d:\n new_d[k] = v\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":15830,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:21","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":38939,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:21","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21323,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:21","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":62,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:56","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":9737,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:56","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6140,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:56","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":1588,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:56","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29938,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:56","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":3875,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:56","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4411,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:56","func_code":"def weird_case(some_str):\n some_str_split = list(some_str)\n i = 0\n k = 0\n string = ''\n while i < len(some_str_split):\n if some_str_split[i].isalpha() == True:\n if k % 2 == 0:\n string = string + some_str_split[i].upper()\n else:\n string = string + some_str_split[i].lower()\n k = k + 1\n else:\n string = string + some_str_split[i]\n i = i + 1\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2679,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:56","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if int(list[i]) == 0:\n list.remove(list[i])\n list.remove(list[i])\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":7206,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-02-27 10:59:56","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8300,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 11:00:03","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":32898,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 11:00:03","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":32330,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-02-27 11:00:03","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":549,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 11:01:06","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n else:\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":35985,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 11:01:06","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n else:\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":23158,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 11:01:06","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12554,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 11:01:06","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39240,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 11:01:06","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n if i % 2 == 0:\n l3.append(l1[i])\n i = i + 1\n j = 0\n while j < len(l2):\n if j % 2 == 0:\n l3.append(l2[j])\n j = j + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8862,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-02-27 11:01:06","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n else:\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":23519,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 11:01:16","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in (l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23729,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 11:01:16","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in (l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":32757,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 11:01:16","func_code":"def merge_lists(l1, l2):\n l3 = []\n for lines in (l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12693,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 11:01:16","func_code":"def weird_case(some_str):\n stringy = ''\n capital = True\n for letters in some_str:\n if capital:\n stringy = stringy + letters.upper()\n else:\n stringy = stringy + letters\n if letters != ' ':\n capital = not capital\n return stringy","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22321,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 11:01:16","func_code":"def weird_case(some_str):\n stringy = ''\n capital = True\n for letters in some_str:\n if capital:\n stringy = stringy + letters.upper()\n else:\n stringy = stringy + letters\n if letters != ' ':\n capital = not capital\n return stringy","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4277,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 11:01:16","func_code":"def weird_case(some_str):\n stringy = ''\n capital = True\n for letters in some_str:\n if capital:\n stringy = stringy + letters.upper()\n else:\n stringy = stringy + letters\n if letters != ' ':\n capital = not capital\n return stringy","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1303,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 11:01:16","func_code":"def remove_zeros(listy):\n i = 0\n for numbers in listy:\n if 0 in listy:\n listy.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":7807,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 11:01:16","func_code":"def remove_zeros(listy):\n i = 0\n for numbers in listy:\n if 0 in listy:\n listy.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23905,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-02-27 11:01:16","func_code":"def remove_zeros(listy):\n i = 0\n for numbers in listy:\n if 0 in listy:\n listy.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10937,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 11:01:53","func_code":"def swap_unique_keys_values(d):\n d = {v: k for k, v in list(d.items())}\n new_d = {}\n for k in d:\n if k not in new_d:\n new_d[k] = d[k]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":5634,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 11:06:35","func_code":"def swap_unique_keys_values(d):\n d = {v: k for k, v in list(d.items())}\n new_d = {}\n for k in d:\n if k not in new_d:\n new_d[k] = d[k]\n else:\n del new_d[k]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":3295,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 11:07:00","func_code":"def swap_unique_keys_values(d):\n d = {v: k for k, v in list(d.items())}\n new_d = {}\n for k in d:\n if k not in new_d:\n new_d[k] = d[k]\n else:\n del new_d[k]\n del d[k]\n del new_d[k]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29465,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 11:14:11","func_code":"def swap_unique_keys_values(d):\n unique_values = list(set(d.values()))\n d = {v: k for k, v in list(d.items())}\n new_d = {}\n for v in unique_values:\n new_d[key] = d[key]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":19947,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 11:14:25","func_code":"def swap_unique_keys_values(d):\n unique_values = list(set(d.values()))\n d = {v: k for k, v in list(d.items())}\n new_d = {}\n for key in unique_values:\n new_d[key] = d[key]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":12143,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 11:15:10","func_code":"def swap_unique_keys_values(d):\n d = {v: k for k, v in list(d.items())}\n new_d = {}\n unique_values = list(set(d.values()))\n for key in unique_values:\n new_d[key] = d[key]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29103,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 11:16:29","func_code":"def swap_unique_keys_values(d):\n unique_values = list(set(d.values()))\n d = {v: k for k, v in list(d.items())}\n new_d = {}\n for key in unique_values:\n new_d[key] = d[key]\n return unique_values","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":13769,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 11:16:29","func_code":"def swap_unique_keys_values(d):\n unique_values = list(set(d.values()))\n d = {v: k for k, v in list(d.items())}\n new_d = {}\n for key in unique_values:\n new_d[key] = d[key]\n return unique_values","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":12600,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-02-27 11:16:29","func_code":"def swap_unique_keys_values(d):\n unique_values = list(set(d.values()))\n d = {v: k for k, v in list(d.items())}\n new_d = {}\n for key in unique_values:\n new_d[key] = d[key]\n return unique_values","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":15428,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-02-27 11:32:24","func_code":"def swap_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n nd[v] = k\n return nd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":448,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-02-27 11:32:24","func_code":"def swap_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n nd[v] = k\n return nd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14270,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-27 11:34:20","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14127,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-27 11:34:20","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4639,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-27 11:34:20","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":36214,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-27 11:34:20","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":16106,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-27 11:34:20","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20238,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-27 11:34:20","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":14213,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-27 11:34:20","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":7803,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-27 11:34:20","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1175,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-02-27 11:34:20","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35268,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-02-27 11:46:20","func_code":"def swap_keys_values(d):\n newd = {}\n for key in d:\n newd[d[key]] = key\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":31594,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-02-27 11:46:20","func_code":"def swap_keys_values(d):\n newd = {}\n for key in d:\n newd[d[key]] = key\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":2486,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-02-27 12:18:26","func_code":"def swap_keys_values(d):\n newd = {}\n for key, value in list(d.items()):\n newd[value] = key\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21803,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-02-27 12:18:26","func_code":"def swap_keys_values(d):\n newd = {}\n for key, value in list(d.items()):\n newd[value] = key\n return newd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21451,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-02-27 12:39:50","func_code":"def swap_unique_keys_values(d):\n newd = {}\n for key, value in list(d.items()):\n if value not in newd:\n newd[value] = key\n else:\n del newd[value]\n return newd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":28726,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-02-27 12:39:50","func_code":"def swap_unique_keys_values(d):\n newd = {}\n for key, value in list(d.items()):\n if value not in newd:\n newd[value] = key\n else:\n del newd[value]\n return newd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35295,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:55:05","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(1, len(l1), 2):\n print(l1[token])\n for i in range(1, len(l2), 2):\n print(l2[i])","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":38062,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:55:05","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n print(sen)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33038,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:55:05","func_code":"def remove_zeros(nums):\n i = 0\n while i < len(nums):\n if int(nums[i]) == 0:\n del nums[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":34392,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-02-27 12:55:25","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n if not v in nd:\n nd[v] = k\n else:\n del nd[v]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":23750,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:56:01","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(1, len(l1), 2):\n print(l1[token])\n for i in range(1, len(l2), 2):\n print(l2[i])","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":40974,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:56:01","func_code":"def remove_zeros(nums):\n i = 0\n while i < len(nums):\n if int(nums[i]) == 0:\n del nums[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":30416,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:56:01","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n print(sen)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3671,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:56:44","func_code":"def remove_zeros(nums):\n i = 0\n while i < len(nums):\n if int(nums[i]) == 0:\n del nums[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":28363,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:56:44","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n print(sen)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35686,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:56:44","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(1, len(l1), 2):\n print(l1[token])\n for i in range(1, len(l2), 2):\n print(l2[i])","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":34705,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:57:22","func_code":"def remove_zeros(nums):\n i = 0\n while i < len(nums):\n if int(nums[i]) == 0:\n del nums[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":41177,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:57:22","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n print(sen)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22645,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 12:57:22","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(1, len(l1), 2):\n print(l1[token])\n for i in range(1, len(l2), 2):\n print(l2[i])","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":15493,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-02-27 12:57:33","func_code":"def swap_unique_keys_values(d):\n nd = {}\n dset = set(d.items())\n return dict(dset)","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":12803,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-02-27 12:58:14","func_code":"def swap_unique_keys_values(d):\n nd = {}\n dset = set(d.items())\n d = dict(dset)\n for k, v in list(d.items()):\n nd[v] = k\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":41875,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-02-27 12:59:10","func_code":"def swap_keys_values(my_dict):\n swapped_dict = {}\n dict_items = sorted(my_dict.items())\n for i in dict_items:\n key, value = i[0], i[1]\n swapped_dict[value] = key\n return swapped_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":1614,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-02-27 12:59:10","func_code":"def swap_keys_values(my_dict):\n swapped_dict = {}\n dict_items = sorted(my_dict.items())\n for i in dict_items:\n key, value = i[0], i[1]\n swapped_dict[value] = key\n return swapped_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":6570,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-02-27 12:59:38","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n if not v in nd:\n nd[v] = k\n else:\n del nd[v]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":42287,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-02-27 12:59:38","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n if not v in nd:\n nd[v] = k\n else:\n del nd[v]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":32308,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-02-27 12:59:38","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n if not v in nd:\n nd[v] = k\n else:\n del nd[v]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":4082,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-02-27 13:00:09","func_code":"def swap_unique_keys_values(my_dict):\n unique_dict = {}\n for k, v in list(my_dict.items()):\n if v in unique_dict:\n del unique_dict[v]\n else:\n unique_dict[v] = k\n return unique_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":25780,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-02-27 13:00:09","func_code":"def swap_unique_keys_values(my_dict):\n unique_dict = {}\n for k, v in list(my_dict.items()):\n if v in unique_dict:\n del unique_dict[v]\n else:\n unique_dict[v] = k\n return unique_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":16375,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:03:31","func_code":"def remove_zeros(nums):\n i = 0\n while i < len(nums):\n if int(nums[i]) == 0:\n del nums[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":684,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:03:31","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(1, len(l1), 2):\n print(l1[token])\n for i in range(1, len(l2), 2):\n print(l2[i])","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":11267,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:03:31","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n print(sen)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":7641,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:08:33","func_code":"def remove_zeros(nums):\n i = 0\n while i < len(nums):\n if int(nums[i]) == 0:\n del nums[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":14207,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:08:33","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(0, len(l1), 2):\n l3.append(l1[token])\n for i in range(0, len(l2), 2):\n l3.append(l2[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24731,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:08:33","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n print(sen)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14811,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:08:57","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(0, len(l1), 2):\n l3.append(l1[token])\n for i in range(0, len(l2), 2):\n l3.append(l2[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17270,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:08:57","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n return sen","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35364,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:08:57","func_code":"def remove_zeros(nums):\n i = 0\n while i < len(nums):\n if int(nums[i]) == 0:\n del nums[i]\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":25510,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:19:47","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(0, len(l1), 2):\n l3.append(l1[token])\n for i in range(0, len(l2), 2):\n l3.append(l2[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37762,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:19:47","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n return sen","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40057,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:19:47","func_code":"def remove_zeros(nums):\n gway = []\n i = 0\n while i < len(nums):\n if int(nums[i]) != 0:\n gway.append(nums[i])\n i = i + 1\n nums = gway","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":22752,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:22:49","func_code":"def remove_zeros(nums):\n gway = []\n i = 0\n while i < len(nums):\n if int(nums[i]) != 0:\n gway.append(nums[i])\n i = i + 1\n nums = gway\n return nums","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":9755,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:22:49","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n return sen","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1773,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 13:22:49","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(0, len(l1), 2):\n l3.append(l1[token])\n for i in range(0, len(l2), 2):\n l3.append(l2[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":374,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-27 13:35:12","func_code":"def swap_unique_keys_values(d):\n A = False\n keyval = []\n new = {}\n done = {}\n for k, v in list(d.items()):\n keyval.append((v, k))\n done[keyval[0][0]] = A\n for each in keyval:\n if each[0] not in done:\n done[each[[0]]] = A\n else:\n done[each[0]] = True\n for each in kv:\n if not done[each[0]]:\n new[each[0]] = each[1]\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":37219,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-27 13:35:29","func_code":"def swap_unique_keys_values(d):\n A = False\n keyval = []\n new = {}\n done = {}\n for k, v in list(d.items()):\n keyval.append((v, k))\n done[keyval[0][0]] = A\n for each in keyval:\n if each[0] not in done:\n done[each[[0]]] = A\n else:\n done[each[0]] = True\n for each in keyval:\n if not done[each[0]]:\n new[each[0]] = each[1]\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":36730,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-27 13:35:43","func_code":"def swap_unique_keys_values(d):\n A = False\n keyval = []\n new = {}\n done = {}\n for k, v in list(d.items()):\n keyval.append((v, k))\n done[keyval[0][0]] = A\n for each in keyval:\n if each[0] not in done:\n done[each[[0]]] = A\n else:\n done[each[0]] = True\n for each in keyval:\n if not done[each[0]]:\n new[each[0]] = each[1]\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29571,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-27 13:36:32","func_code":"def swap_unique_keys_values(d):\n A = False\n keyval = []\n new = {}\n done = {}\n for k, v in list(d.items()):\n keyval.append((v, k))\n done[keyval[0][0]] = A\n for each in keyval:\n if each[0] not in done:\n done[each[[0]]] = A\n else:\n done[each[0]] = True\n for each in keyval:\n if not done[each[0]]:\n new[each[0]] = each[1]\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":14935,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-27 13:36:42","func_code":"def swap_unique_keys_values(d):\n A = False\n keyval = []\n new = {}\n done = {}\n for k, v in list(d.items()):\n keyval.append((v, k))\n done[keyval[0][0]] = A\n for each in keyval:\n if each[0] not in done:\n done[each[[0]]] = A\n else:\n done[each[0]] = True\n for each in keyval:\n if not done[each[0]]:\n new[each[0]] = each[1]\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":19323,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-27 13:36:47","func_code":"def swap_unique_keys_values(d):\n A = False\n keyval = []\n new = {}\n done = {}\n for k, v in list(d.items()):\n keyval.append((v, k))\n done[keyval[0][0]] = A\n for each in keyval:\n if each[0] not in done:\n done[each[[0]]] = A\n else:\n done[each[0]] = True\n for each in keyval:\n if not done[each[0]]:\n new[each[0]] = each[1]\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29245,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-27 13:36:51","func_code":"def swap_unique_keys_values(d):\n A = False\n keyval = []\n new = {}\n done = {}\n for k, v in list(d.items()):\n keyval.append((v, k))\n done[keyval[0][0]] = A\n for each in keyval:\n if each[0] not in done:\n done[each[[0]]] = A\n else:\n done[each[0]] = True\n for each in keyval:\n if not done[each[0]]:\n new[each[0]] = each[1]\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29146,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-27 13:38:17","func_code":"def swap_unique_keys_values(d):\n new = {}\n for k, v in list(d.items()):\n if v not in new:\n new[v] = k\n else:\n del new[v]\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":9978,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-02-27 13:38:17","func_code":"def swap_unique_keys_values(d):\n new = {}\n for k, v in list(d.items()):\n if v not in new:\n new[v] = k\n else:\n del new[v]\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":641,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-02-27 13:56:31","func_code":"def swap_keys_values(d):\n a = []\n b = []\n for key in list(d.keys()):\n a.append(key)\n b.append(d[key])\n d_new = {}\n for i in range(0, len(a)):\n d_new[b[i]] = a[i]\n return d_new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":6779,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-02-27 13:56:31","func_code":"def swap_keys_values(d):\n a = []\n b = []\n for key in list(d.keys()):\n a.append(key)\n b.append(d[key])\n d_new = {}\n for i in range(0, len(a)):\n d_new[b[i]] = a[i]\n return d_new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":16036,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-02-27 14:03:08","func_code":"def swap_unique_keys_values(d):\n a = []\n b = []\n for key in list(d.keys()):\n a.append(key)\n b.append(d[key])\n d_new = {}\n for i in range(0, len(a)):\n if b.count(b[i]) == 1:\n d_new[b[i]] = a[i]\n return d_new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":34871,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-02-27 14:04:07","func_code":"def swap_unique_keys_values(d):\n a = []\n b = []\n for key in list(d.keys()):\n a.append(key)\n b.append(d[key])\n d_new = {}\n for i in range(0, len(a)):\n if b.count(b[i]) == 1:\n d_new[b[i]] = a[i]\n return d_new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":3897,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-02-27 14:04:07","func_code":"def swap_unique_keys_values(d):\n a = []\n b = []\n for key in list(d.keys()):\n a.append(key)\n b.append(d[key])\n d_new = {}\n for i in range(0, len(a)):\n if b.count(b[i]) == 1:\n d_new[b[i]] = a[i]\n return d_new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":32238,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-27 14:37:41","func_code":"def swap_unique_keys_values(dictionary_descriptor):\n new_dictionary = {}\n addthese = set()\n for keys, values in list(dictionary_descriptor.items()):\n if values in new_dictionary:\n addthese.update([values])\n del new_dictionary[values]\n elif values not in new_dictionary:\n new_dictionary[values] = keys\n return new_dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":12595,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-02-27 14:37:41","func_code":"def swap_unique_keys_values(dictionary_descriptor):\n new_dictionary = {}\n addthese = set()\n for keys, values in list(dictionary_descriptor.items()):\n if values in new_dictionary:\n addthese.update([values])\n del new_dictionary[values]\n elif values not in new_dictionary:\n new_dictionary[values] = keys\n return new_dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6741,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-02-27 15:01:06","func_code":"def swap_keys_values(d):\n swapped_d = {}\n for k, v in list(d.items()):\n swapped_d[v] = k\n print(swapped_d)","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":17679,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-02-27 15:01:23","func_code":"def swap_keys_values(d):\n swapped_d = {}\n for k, v in list(d.items()):\n swapped_d[v] = k\n return swapped_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14820,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-02-27 15:01:23","func_code":"def swap_keys_values(d):\n swapped_d = {}\n for k, v in list(d.items()):\n swapped_d[v] = k\n return swapped_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14155,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-02-27 15:22:43","func_code":"def get_frequency(iterable):\n f = {}\n for i in iterable:\n if i not in f:\n f[i] = 1\n else:\n f[i] += 1\n return f\n\n\ndef swap_unique_keys_values(d):\n swapped_d = {}\n frequency = get_frequency(list(d.values()))\n for k, v in list(d.items()):\n if frequency[v] != 1:\n continue\n swapped_d[v] = k\n return swapped_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":28767,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-02-27 15:22:43","func_code":"def get_frequency(iterable):\n f = {}\n for i in iterable:\n if i not in f:\n f[i] = 1\n else:\n f[i] += 1\n return f\n\n\ndef swap_unique_keys_values(d):\n swapped_d = {}\n frequency = get_frequency(list(d.values()))\n for k, v in list(d.items()):\n if frequency[v] != 1:\n continue\n swapped_d[v] = k\n return swapped_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":41596,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-02-27 15:22:43","func_code":"def get_frequency(iterable):\n f = {}\n for i in iterable:\n if i not in f:\n f[i] = 1\n else:\n f[i] += 1\n return f\n\n\ndef swap_unique_keys_values(d):\n swapped_d = {}\n frequency = get_frequency(list(d.values()))\n for k, v in list(d.items()):\n if frequency[v] != 1:\n continue\n swapped_d[v] = k\n return swapped_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35974,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-02-27 16:03:15","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n newd = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n newd[values[i]] = keys[i]\n return newd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":19764,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-02-27 16:03:15","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n newd = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n newd[values[i]] = keys[i]\n return newd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":31368,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-02-27 16:03:15","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n newd = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n newd[values[i]] = keys[i]\n return newd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6305,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 16:28:19","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n return sen","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":5166,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 16:28:19","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(0, len(l1), 2):\n l3.append(l1[token])\n for i in range(0, len(l2), 2):\n l3.append(l2[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17238,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 16:28:19","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(0, len(l1), 2):\n l3.append(l1[token])\n for i in range(0, len(l2), 2):\n l3.append(l2[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9286,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 16:28:19","func_code":"def remove_zeros(nums):\n gway = []\n i = 0\n while i < len(nums):\n if int(nums[i]) != 0:\n gway.append(nums[i])\n i = i + 1\n nums = gway\n return nums","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":28645,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 16:28:19","func_code":"def remove_zeros(nums):\n gway = []\n i = 0\n while i < len(nums):\n if int(nums[i]) != 0:\n gway.append(nums[i])\n i = i + 1\n nums = gway\n return nums","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":21508,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 16:28:19","func_code":"def remove_zeros(nums):\n gway = []\n i = 0\n while i < len(nums):\n if int(nums[i]) != 0:\n gway.append(nums[i])\n i = i + 1\n nums = gway\n return nums","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":34787,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 16:28:19","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(0, len(l1), 2):\n l3.append(l1[token])\n for i in range(0, len(l2), 2):\n l3.append(l2[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23581,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 16:28:19","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n return sen","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10896,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-02-27 16:28:19","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n return sen","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1860,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-02-27 17:15:54","func_code":"def swap_keys_values(d):\n a = {}\n for k, v in list(d.items()):\n a[v] = k\n return a","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":36640,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-02-27 17:15:54","func_code":"def swap_keys_values(d):\n a = {}\n for k, v in list(d.items()):\n a[v] = k\n return a","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":23978,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-02-27 17:15:58","func_code":"def swap_unique_keys_values(d):\n a = {}\n dups = {}\n for k, v in list(d.items()):\n if v not in dups:\n if v in a:\n del a[v]\n dups[v] = True\n else:\n a[v] = k\n return a","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":34691,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-02-27 17:15:58","func_code":"def swap_unique_keys_values(d):\n a = {}\n dups = {}\n for k, v in list(d.items()):\n if v not in dups:\n if v in a:\n del a[v]\n dups[v] = True\n else:\n a[v] = k\n return a","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":23428,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-02-27 17:41:19","func_code":"def swap_keys_values(d):\n nd = {v: k for k, v in list(d.items())}\n return nd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":13141,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-02-27 17:41:19","func_code":"def swap_keys_values(d):\n nd = {v: k for k, v in list(d.items())}\n return nd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18465,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-02-27 17:41:19","func_code":"def swap_keys_values(d):\n nd = {v: k for k, v in list(d.items())}\n return nd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":39665,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2018-02-27 18:56:55","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":16974,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2018-02-27 18:56:55","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18174,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2018-02-27 18:57:01","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in new_d:\n new_d[v] = k\n else:\n del new_d[v]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":4965,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2018-02-27 18:57:01","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in new_d:\n new_d[v] = k\n else:\n del new_d[v]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":7124,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-02-27 20:10:30","func_code":"def swap_keys_values(old_dict):\n dict = {v: k for k, v in list(old_dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":22114,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-02-27 20:10:58","func_code":"def swap_keys_values(my_dict):\n new_dict = {v: k for k, v in list(my_dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":34069,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-02-27 20:10:58","func_code":"def swap_keys_values(my_dict):\n new_dict = {v: k for k, v in list(my_dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":32456,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-02-27 20:10:58","func_code":"def swap_keys_values(my_dict):\n new_dict = {v: k for k, v in list(my_dict.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":17428,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 20:11:28","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])[2]\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])[2]\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":29064,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 20:12:23","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":35847,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 20:13:48","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9419,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 20:14:34","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i]).split(',')\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33381,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 20:15:15","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i]).split\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2].split(',')","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":12286,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 20:16:50","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39049,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 20:16:50","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":630,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-02-27 20:16:50","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28108,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:20:59","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(a.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":31717,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:21:12","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":10197,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:21:12","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":16160,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:36:08","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if {k, v} not in wards:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":26799,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:36:24","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v not in wards:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35725,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:37:42","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v not in wards:\n wards[k] = v\n elif v in wards:\n del d[v]\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":37299,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:37:51","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v not in wards:\n wards[k] = v\n elif v in wards:\n del d[v]\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":34238,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:40:29","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v not in wards:\n wards[k] = v\n elif v in wards:\n del d[k]\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6846,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:41:10","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v not in wards:\n wards[k] = v\n elif v in wards:\n d.pop(k, v)\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18189,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:41:40","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v in wards:\n d.pop(k, v)\n if v not in wards:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":40173,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:43:58","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v in wards:\n d.pop(k, v)\n d.pop(k, v)\n if v not in wards:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":14561,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:44:26","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v in wards:\n d.pop(k, None)\n if v not in wards:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6719,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:45:15","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v in wards:\n del d[k, v]\n if v not in wards:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":1633,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:45:43","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v in wards:\n del wards[k, v]\n if v not in wards:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":5943,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:47:46","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v in wards:\n wards.pop([k])\n if v not in wards:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":16876,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:56:38","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v in wards:\n bad[k] = v\n elif v not in wards:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":38742,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:56:57","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v in wards:\n bad[k] = v\n else:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":4783,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:56:57","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v in wards:\n bad[k] = v\n else:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":9742,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-27 23:56:57","func_code":"def swap_unique_keys_values(d):\n wards = {}\n for k, v in list(d.items()):\n if v in wards:\n bad[k] = v\n else:\n wards[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":9704,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 00:02:00","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v in wards:\n bad[k] = v\n elif v not in wards:\n wards[k] = v\n for wards in bad:\n if wards not in bad:\n end.update(wards)\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":40600,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 00:02:41","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v in wards:\n bad[k] = v\n elif v not in wards:\n wards[k] = v\n for wards in bad:\n if wards not in bad:\n end.update(wards)\n return {v: k for k, v in list(wards.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":13296,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 00:03:47","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v in wards:\n bad[k] = v\n elif v not in wards:\n wards[k] = v\n for k, v in list(wards.items()):\n if v not in bad:\n end[k] = v\n return {v: k for k, v in list(end.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":3834,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 00:04:15","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v in wards:\n bad[k] = v\n elif v not in wards:\n wards[k] = v\n for k, v in list(wards.items()):\n if v not in bad:\n end[k] = v\n return bad","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":31761,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 00:04:51","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v not in wards:\n wards[k] = v\n elif v in wards:\n bad[k] = v\n for k, v in list(wards.items()):\n if v not in bad:\n end[k] = v\n return {v: k for k, v in list(end.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":19424,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 00:05:17","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v not in wards:\n wards[k] = v\n elif v in wards:\n bad[k] = v\n for k, v in list(wards.items()):\n if v not in bad:\n end[k] = v\n return {v: k for k, v in list(wards.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":42019,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 00:08:49","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v not in wards:\n wards[k] = v\n elif v in wards:\n del wards[k]\n return {v: k for k, v in list(wards.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":40282,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 00:09:52","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v in wards:\n del wards[k]\n elif v not in wards:\n wards[k] = v\n return {v: k for k, v in list(wards.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6861,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 00:12:07","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v in wards:\n del wards[k, v]\n elif v not in wards:\n wards[k] = v\n return {v: k for k, v in list(wards.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":14555,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 09:24:55","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v in wards:\n del wards[v]\n elif v not in wards:\n wards[k] = v\n return {v: k for k, v in list(wards.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":21535,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-02-28 11:22:27","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n values_once = set(d.values())\n unique_values = []\n for n in values_once:\n if list(d.values()).count(n) == 1:\n unique_values.append(n)\n for k, v in list(d.items()):\n if v in unique_values:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":3995,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-02-28 11:22:27","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n values_once = set(d.values())\n unique_values = []\n for n in values_once:\n if list(d.values()).count(n) == 1:\n unique_values.append(n)\n for k, v in list(d.items()):\n if v in unique_values:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":3862,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-02-28 11:22:27","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n values_once = set(d.values())\n unique_values = []\n for n in values_once:\n if list(d.values()).count(n) == 1:\n unique_values.append(n)\n for k, v in list(d.items()):\n if v in unique_values:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":19425,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 12:50:49","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v in wards:\n bad[k] = v\n elif v not in wards:\n wards[k] = v\n for k, v in list(wards.items()):\n if v in bad:\n del wards[v]\n elif v not in bad:\n end[k] = v\n return {v: k for k, v in list(end.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30176,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 12:50:49","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v in wards:\n bad[k] = v\n elif v not in wards:\n wards[k] = v\n for k, v in list(wards.items()):\n if v in bad:\n del wards[v]\n elif v not in bad:\n end[k] = v\n return {v: k for k, v in list(end.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":31395,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-02-28 12:50:49","func_code":"def swap_unique_keys_values(d):\n wards = {}\n bad = {}\n end = {}\n for k, v in list(d.items()):\n if v in wards:\n bad[k] = v\n elif v not in wards:\n wards[k] = v\n for k, v in list(wards.items()):\n if v in bad:\n del wards[v]\n elif v not in bad:\n end[k] = v\n return {v: k for k, v in list(end.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":23466,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-02-28 12:56:16","func_code":"def swap_keys_values(my_dict):\n new = {}\n for k, v in list(my_dict.items()):\n new[v] = k\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":41525,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-02-28 12:56:16","func_code":"def swap_keys_values(my_dict):\n new = {}\n for k, v in list(my_dict.items()):\n new[v] = k\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":10972,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-02-28 13:45:14","func_code":"def swap_keys_values(d):\n d_2 = []\n for entry in list(d.items()):\n u = entry[::-1]\n for k, v in u:\n d_2[k] = v\n return d_2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":12754,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-02-28 13:46:36","func_code":"def swap_keys_values(d):\n d_2 = []\n for entry in list(d.items()):\n u = entry[::-1]\n for k, v in u.split(','):\n d_2[k] = v\n return d_2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":40179,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-02-28 13:47:49","func_code":"def swap_keys_values(d):\n a = []\n for entry in list(d.items()):\n u = entry[::-1]\n a.append(u)\n return a","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":3472,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-02-28 13:53:14","func_code":"def swap_unique_keys_values(my_dict):\n new = {}\n seen = []\n unseen = []\n for k, v in list(my_dict.items()):\n if v in unseen:\n seen.append(v)\n else:\n unseen.append(v)\n for k in my_dict:\n if my_dict[k] not in seen and unseen:\n new[my_dict[k]] = k\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35624,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-02-28 13:53:14","func_code":"def swap_unique_keys_values(my_dict):\n new = {}\n seen = []\n unseen = []\n for k, v in list(my_dict.items()):\n if v in unseen:\n seen.append(v)\n else:\n unseen.append(v)\n for k in my_dict:\n if my_dict[k] not in seen and unseen:\n new[my_dict[k]] = k\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":19572,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-02-28 13:54:23","func_code":"def swap_keys_values(d):\n a = []\n for entry in list(d.items()):\n u = entry[::-1]\n a.append(u)\n return a","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":19666,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-02-28 13:55:20","func_code":"def swap_keys_values(a):\n for entry in a:\n u = entry[::-1]\n a.append(u)\n return a","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":36531,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-02-28 13:56:05","func_code":"def swap_keys_values(d):\n a = []\n for entry in d:\n u = entry[::-1]\n a.append(u)\n return a","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":14051,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-02-28 13:56:05","func_code":"def swap_keys_values(d):\n a = []\n for entry in d:\n u = entry[::-1]\n a.append(u)\n return a","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":18731,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-02-28 15:04:01","func_code":"def swap_unique_keys_values(my_dict):\n seen = []\n unseen = []\n for key in list(my_dict.keys()):\n value = my_dict[key]\n if value in unseen:\n seen.append(value)\n else:\n unseen.append(value)\n new_dict = {v: k for k, v in list(my_dict.items()) if v not in seen}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":16628,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-02-28 15:04:01","func_code":"def swap_unique_keys_values(my_dict):\n seen = []\n unseen = []\n for key in list(my_dict.keys()):\n value = my_dict[key]\n if value in unseen:\n seen.append(value)\n else:\n unseen.append(value)\n new_dict = {v: k for k, v in list(my_dict.items()) if v not in seen}\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":21923,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-02-28 15:06:59","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":31235,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-02-28 15:06:59","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35564,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-02-28 15:25:35","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.has(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29852,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-02-28 15:25:57","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":40577,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-02-28 15:25:57","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":41301,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-02-28 15:25:57","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":40971,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-02-28 17:56:41","func_code":"def swap_unique_keys_values(d):\n count = {}\n for v in [v for k, v in list(d.items())]:\n if v not in count:\n count[v] = 1\n else:\n count[v] += 1\n multiples = [k for k, v in list(count.items()) if v > 1]\n new_d = {}\n for k, v in list(d.items()):\n if v not in multiples:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":34130,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-02-28 17:56:41","func_code":"def swap_unique_keys_values(d):\n count = {}\n for v in [v for k, v in list(d.items())]:\n if v not in count:\n count[v] = 1\n else:\n count[v] += 1\n multiples = [k for k, v in list(count.items()) if v > 1]\n new_d = {}\n for k, v in list(d.items()):\n if v not in multiples:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":26064,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-02-28 17:56:41","func_code":"def swap_unique_keys_values(d):\n count = {}\n for v in [v for k, v in list(d.items())]:\n if v not in count:\n count[v] = 1\n else:\n count[v] += 1\n multiples = [k for k, v in list(count.items()) if v > 1]\n new_d = {}\n for k, v in list(d.items()):\n if v not in multiples:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":28037,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-03-01 10:47:31","func_code":"def swap_unique_keys_values(d):\n dic = {}\n a = []\n b = []\n for key in d:\n value = d[key]\n if value not in a:\n a.append(value)\n else:\n b.append(value)\n for key in d:\n value = d[key]\n if value not in b:\n dic[value] = key\n a.append(value)\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":26151,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-03-01 10:47:31","func_code":"def swap_unique_keys_values(d):\n dic = {}\n a = []\n b = []\n for key in d:\n value = d[key]\n if value not in a:\n a.append(value)\n else:\n b.append(value)\n for key in d:\n value = d[key]\n if value not in b:\n dic[value] = key\n a.append(value)\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":40770,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-03-01 13:23:05","func_code":"def swap_keys_values(d):\n d1 = {}\n items = list(d.items())\n for item in items:\n d1[item[1]] = item[0]\n return d1","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":15905,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-03-01 13:23:05","func_code":"def swap_keys_values(d):\n d1 = {}\n items = list(d.items())\n for item in items:\n d1[item[1]] = item[0]\n return d1","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":28235,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-01 13:57:44","func_code":"def swap_keys_values(d):\n a = []\n d_2 = {}\n for entry in list(d.items()):\n swap = entry[::-1]\n a.append(swap)\n for k, v in a:\n d_2[k] = v\n return d_2\n main()","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":10146,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-01 13:58:14","func_code":"def swap_keys_values(d):\n a = []\n d_2 = {}\n for entry in list(d.items()):\n swap = entry[::-1]\n a.append(swap)\n for k, v in a:\n d_2[k] = v\n return d_2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":42366,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-01 13:58:14","func_code":"def swap_keys_values(d):\n a = []\n d_2 = {}\n for entry in list(d.items()):\n swap = entry[::-1]\n a.append(swap)\n for k, v in a:\n d_2[k] = v\n return d_2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14602,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-03-01 14:09:32","func_code":"def swap_unique_keys_values(d):\n d1 = {}\n items = list(d.items())\n for item in items:\n if item[1] not in d1:\n d1[item[1]] = item[0]\n else:\n d1.pop(item[1])\n return d1","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":38086,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-03-01 14:09:32","func_code":"def swap_unique_keys_values(d):\n d1 = {}\n items = list(d.items())\n for item in items:\n if item[1] not in d1:\n d1[item[1]] = item[0]\n else:\n d1.pop(item[1])\n return d1","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":1451,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-01 14:23:17","func_code":"def swap_keys_values(d):\n nd = {}\n for i, v in list(d.items()):\n nd[v] = i\n return nd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":24355,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-01 14:23:17","func_code":"def swap_keys_values(d):\n nd = {}\n for i, v in list(d.items()):\n nd[v] = i\n return nd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18590,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-01 14:27:58","func_code":"def swap_unique_keys_values(d):\n a = []\n d_2 = {}\n for entry in list(d.items()):\n swap = entry[::-1]\n a.append(swap)\n for k, v in a:\n d_2[k] = v\n return d_2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":42203,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-03-01 14:50:52","func_code":"def swap_unique_keys_values(d):\n seen = []\n unseen = []\n for v in list(d.keys()):\n va = d[v]\n if va in unseen:\n seen.append(va)\n else:\n unseen.append(va)\n out = {v: k for k, v in list(d.items()) if v in unseen}\n return out","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":41744,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-03-01 14:52:06","func_code":"def swap_unique_keys_values(d):\n seen = []\n unseen = []\n for v in list(d.keys()):\n va = d[v]\n if va in unseen:\n seen.append(va)\n else:\n unseen.append(va)\n out = {v: k for k, v in list(d.items()) if v not in seen}\n return out","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":20528,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-03-01 14:52:06","func_code":"def swap_unique_keys_values(d):\n seen = []\n unseen = []\n for v in list(d.keys()):\n va = d[v]\n if va in unseen:\n seen.append(va)\n else:\n unseen.append(va)\n out = {v: k for k, v in list(d.items()) if v not in seen}\n return out","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":34327,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-01 15:17:33","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for i, v in list(d.items()):\n if v not in nd:\n nd[v] = i\n elif v in nd:\n del nd[v]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":12553,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-01 15:17:33","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for i, v in list(d.items()):\n if v not in nd:\n nd[v] = i\n elif v in nd:\n del nd[v]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":18318,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-01 15:17:33","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for i, v in list(d.items()):\n if v not in nd:\n nd[v] = i\n elif v in nd:\n del nd[v]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":24329,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-01 15:29:52","func_code":"def swap_keys_values(d):\n d2 = {}\n ds = sorted(d.items, reverse=True)\n for k, v in ds:\n d2[v] = k\n return d2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":9172,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 15:47:01","func_code":"def swap_keys_values(d):\n for key in d:\n key = tmp\n key = d[key]\n d[key] = tmp\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":20640,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 15:47:25","func_code":"def swap_keys_values(d):\n tmp = ''\n for key in d:\n key = tmp\n key = d[key]\n d[key] = tmp\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":32179,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 15:50:50","func_code":"def swap_keys_values(d):\n tmp = ''\n for key in d:\n key = key.split()\n tmp = key[0]\n key[0] = key[1]\n key[1] = tmp\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":34219,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 15:51:22","func_code":"def swap_keys_values(d):\n for key in d:\n key = key.split()\n tmp = key[0]\n key[0] = key[1]\n key[1] = tmp\n return tmp","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":18058,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 15:51:50","func_code":"def swap_keys_values(d):\n for key in d:\n key = key.split()\n return key","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":880,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 15:55:42","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":32333,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-01 16:10:12","func_code":"def swap_keys_values(d):\n d2 = {}\n ds = sorted(list(d.items()), reverse=True)\n print(ds)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n return d2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":8667,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-01 16:11:02","func_code":"def swap_keys_values(d):\n d2 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n return d2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":23005,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-01 16:11:02","func_code":"def swap_keys_values(d):\n d2 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n return d2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":26134,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-01 16:33:02","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6872,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-01 16:33:02","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":42275,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-01 16:33:02","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":37748,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-01 16:48:41","func_code":"def swap_unique_keys_values(d):\n return {[(b, a) for a, b in list(d.items()) if list(d.values()).count(b\n ) == 1]}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18262,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-01 16:49:08","func_code":"def swap_unique_keys_values(d):\n return {(b, a) for a, b in list(d.items()) if list(d.values()).count(b) ==\n 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":14135,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-01 16:49:08","func_code":"def swap_unique_keys_values(d):\n return {(b, a) for a, b in list(d.items()) if list(d.values()).count(b) ==\n 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":12603,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-01 16:49:08","func_code":"def swap_unique_keys_values(d):\n return {(b, a) for a, b in list(d.items()) if list(d.values()).count(b) ==\n 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18480,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-01 16:57:46","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n print(ds)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'X'\n print(d2)\n ds2 = sorted(list(d2.items()), reverse=True)\n print(ds2)\n for k, v in ds2:\n if v != 'X':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":8147,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-01 16:58:17","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'X'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'X':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":815,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-01 16:58:17","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'X'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'X':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6784,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-01 16:58:17","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'X'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'X':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":32075,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-01 17:00:20","func_code":"def swap_keys_values(d):\n new_d = {}\n for key in d:\n new_d[d[key]] = key\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18832,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-01 17:00:20","func_code":"def swap_keys_values(d):\n new_d = {}\n for key in d:\n new_d[d[key]] = key\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":2499,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-01 17:15:03","func_code":"def swap_keys_values(dic):\n keys = list(dic.keys())\n values = list(dic.values())\n d = {}\n i = 0\n for v in values:\n d[keys[i]] = v[i]\n i = i + 1\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":7023,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-01 17:22:15","func_code":"def swap_keys_values(dic):\n keys = list(dic.keys())\n values = list(dic.values())\n d = {}\n i = 0\n for v in values:\n d[v[i]] = keys[i]\n i = i + 1","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":25423,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-01 17:37:33","func_code":"def swap_keys_values(dic):\n keys = list(dic.keys())\n values = list(dic.values())\n d = {}\n values = []\n keys = []\n for v in list(dic.values()):\n values.append(str(v))\n for k in list(dic.keys()):\n keys.append(k)\n i = 0\n while i < len(values):\n d[values[i]] = keys[i]\n i = i + 1\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":24835,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-01 17:38:37","func_code":"def swap_keys_values(dic):\n keys = list(dic.keys())\n values = list(dic.values())\n d = {}\n values = []\n keys = []\n for v in list(dic.values()):\n values.append(v)\n for k in list(dic.keys()):\n keys.append(k)\n i = 0\n while i < len(values):\n d[values[i]] = keys[i]\n i = i + 1\n return sorted(d)","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":7150,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-01 17:39:12","func_code":"def swap_keys_values(dic):\n keys = list(dic.keys())\n values = list(dic.values())\n d = {}\n values = []\n keys = []\n for v in list(dic.values()):\n values.append(str(v))\n for k in list(dic.keys()):\n keys.append(k)\n i = 0\n while i < len(values):\n d[values[i]] = keys[i]\n i = i + 1\n return sorted(d)","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":19725,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-01 17:39:24","func_code":"def swap_keys_values(dic):\n keys = list(dic.keys())\n values = list(dic.values())\n d = {}\n values = []\n keys = []\n for v in list(dic.values()):\n values.append(str(v))\n for k in list(dic.keys()):\n keys.append(k)\n i = 0\n while i < len(values):\n d[values[i]] = keys[i]\n i = i + 1\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":22169,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-01 17:39:37","func_code":"def swap_keys_values(dic):\n keys = list(dic.keys())\n values = list(dic.values())\n d = {}\n values = []\n keys = []\n for v in list(dic.values()):\n values.append(v)\n for k in list(dic.keys()):\n keys.append(k)\n i = 0\n while i < len(values):\n d[values[i]] = keys[i]\n i = i + 1\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":40226,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-01 17:39:37","func_code":"def swap_keys_values(dic):\n keys = list(dic.keys())\n values = list(dic.values())\n d = {}\n values = []\n keys = []\n for v in list(dic.values()):\n values.append(v)\n for k in list(dic.keys()):\n keys.append(k)\n i = 0\n while i < len(values):\n d[values[i]] = keys[i]\n i = i + 1\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":28546,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-01 17:39:38","func_code":"def swap_keys_values(d):\n print({v: k for k, v in list(d.items())})","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":30165,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-01 17:43:30","func_code":"def swap_unique_keys_values(dic):\n keys = list(dic.keys())\n values = list(dic.values())\n d = {}\n values = []\n keys = []\n for v in list(dic.values()):\n values.append(v)\n for k in list(dic.keys()):\n keys.append(k)\n i = 0\n while i < len(values):\n if values[i] not in d:\n d[values[i]] = keys[i]\n i = i + 1\n return d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":39725,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-01 17:43:55","func_code":"def swap_unique_keys_values(dic):\n keys = list(dic.keys())\n values = list(dic.values())\n d = {}\n values = []\n keys = []\n for v in list(dic.values()):\n values.append(v)\n for k in list(dic.keys()):\n keys.append(k)\n i = 0\n while i < len(values):\n if values[i] not in d:\n d[values[i]] = keys[i]\n elif values[i] in d:\n del d[values[i]]\n i = i + 1\n return d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35279,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-01 17:43:55","func_code":"def swap_unique_keys_values(dic):\n keys = list(dic.keys())\n values = list(dic.values())\n d = {}\n values = []\n keys = []\n for v in list(dic.values()):\n values.append(v)\n for k in list(dic.keys()):\n keys.append(k)\n i = 0\n while i < len(values):\n if values[i] not in d:\n d[values[i]] = keys[i]\n elif values[i] in d:\n del d[values[i]]\n i = i + 1\n return d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":2401,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-01 17:44:01","func_code":"def swap_keys_values(d):\n d = {v: k for k, v in list(d.items())}\n print(list(d.items()))","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":21656,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-01 17:44:24","func_code":"def swap_keys_values(d):\n d = {v: k for k, v in list(d.items())}\n print(list(d.items()))","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":13449,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-01 17:47:43","func_code":"def swap_keys_values(d):\n d = {v: k for k, v in list(d.items())}\n list(d.items())","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":38045,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-01 17:48:28","func_code":"def swap_keys_values(d):\n new = {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":9159,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-01 17:48:47","func_code":"def swap_keys_values(d):\n new = {v: k for k, v in list(d.items())}\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":32991,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-01 17:48:47","func_code":"def swap_keys_values(d):\n new = {v: k for k, v in list(d.items())}\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21765,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-01 18:02:57","func_code":"def swap_unique_keys_values(d):\n values = [d[k] for k in d]\n new = {v: k for k, v in list(d.items()) if values.count(v) == 1}\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":25047,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-01 18:02:57","func_code":"def swap_unique_keys_values(d):\n values = [d[k] for k in d]\n new = {v: k for k, v in list(d.items()) if values.count(v) == 1}\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":40419,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-01 18:02:57","func_code":"def swap_unique_keys_values(d):\n values = [d[k] for k in d]\n new = {v: k for k, v in list(d.items()) if values.count(v) == 1}\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6739,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:05:47","func_code":"def swap_keys_values(x):\n d = {v: k for k, v in list(d.items())}\n return x","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":17348,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:06:03","func_code":"def swap_keys_values(x):\n d = {v: k for k, v in list(a.items())}\n return x","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":33395,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:06:16","func_code":"def swap_keys_values(x):\n d = {v: k for k, v in list(x.items())}\n return x","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":24152,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:07:24","func_code":"def swap_keys_values(x):\n d = dict((v, k) for k, v in list(x.items()))\n return x","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":3826,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:08:17","func_code":"def swap_keys_values(x):\n d = dict((k, v) for v, k in list(x.items()))\n return x","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":2910,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:09:22","func_code":"def swap_keys_values(x):\n for key, v in list(x.items()):\n d[v] = key\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":16238,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:09:37","func_code":"def swap_keys_values(x):\n d = {}\n for key, v in list(x.items()):\n d[v] = key\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":29935,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:10:39","func_code":"def swap_keys_values(x):\n d = {v: k for k, v in list(x.items())}\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":30738,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 18:19:21","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n sortd = sorted(list(d.items()), reverse=True)\n return sortd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":28023,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 18:21:46","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n d[key] = value\n d[value] = d[key]\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":11032,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 18:22:30","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = d[key]\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":33998,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 18:22:40","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":8664,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 18:22:40","func_code":"def swap_keys_values(d):\n dic = {}\n for key in d:\n value = d[key]\n dic[value] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":40222,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-01 18:24:47","func_code":"def swap_unique_keys_values(d):\n unique = {}\n new_d = {}\n for key in d:\n if d[key] not in unique:\n unique[d[key]] = 0\n unique[d[key]] = unique[d[key]] + 1\n for key in d:\n if unique[d[key]] == 1:\n new_d[d[key]] = key\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":17809,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-01 18:24:47","func_code":"def swap_unique_keys_values(d):\n unique = {}\n new_d = {}\n for key in d:\n if d[key] not in unique:\n unique[d[key]] = 0\n unique[d[key]] = unique[d[key]] + 1\n for key in d:\n if unique[d[key]] == 1:\n new_d[d[key]] = key\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":10967,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-01 18:24:47","func_code":"def swap_unique_keys_values(d):\n unique = {}\n new_d = {}\n for key in d:\n if d[key] not in unique:\n unique[d[key]] = 0\n unique[d[key]] = unique[d[key]] + 1\n for key in d:\n if unique[d[key]] == 1:\n new_d[d[key]] = key\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":28123,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:25:18","func_code":"def swap_unique_keys_values(x):\n sorx = sorted(d.items, reverse=True)\n x1 = {}\n x2 = {}\n for keys, values in sorx:\n if v not in x1:\n x1[values] = keys\n else:\n x1[v] = 'N'\n sorx2 = sorted(list(x1.items()), revers=True)\n for keys, values in sorx2:\n if v != sorx2:\n x2[keys] = values\n return x2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":10665,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:25:39","func_code":"def swap_unique_keys_values(x):\n sorx = sorted(x.items, reverse=True)\n x1 = {}\n x2 = {}\n for keys, values in sorx:\n if v not in x1:\n x1[values] = keys\n else:\n x1[v] = 'N'\n sorx2 = sorted(list(x1.items()), revers=True)\n for keys, values in sorx2:\n if v != sorx2:\n x2[keys] = values\n return x2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":987,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:26:13","func_code":"def swap_unique_keys_values(x):\n x1 = {}\n x2 = {}\n sorx = sorted(x.items, reverse=True)\n for keys, values in sorx:\n if v not in x1:\n x1[values] = keys\n else:\n x1[v] = 'N'\n sorx2 = sorted(list(x1.items()), revers=True)\n for keys, values in sorx2:\n if v != sorx2:\n x2[keys] = values\n return x2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":25649,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:26:27","func_code":"def swap_unique_keys_values(x):\n x1 = {}\n x2 = {}\n sorx = sorted(list(x.items()), reverse=True)\n for keys, values in sorx:\n if v not in x1:\n x1[values] = keys\n else:\n x1[v] = 'N'\n sorx2 = sorted(list(x1.items()), revers=True)\n for keys, values in sorx2:\n if v != sorx2:\n x2[keys] = values\n return x2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":36051,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:26:49","func_code":"def swap_unique_keys_values(x):\n x1 = {}\n x2 = {}\n sorx = sorted(list(x.items()), reverse=True)\n for keys, values in sorx:\n if values not in x1:\n x1[values] = keys\n else:\n x1[v] = 'N'\n sorx2 = sorted(list(x1.items()), revers=True)\n for keys, values in sorx2:\n if values != sorx2:\n x2[keys] = values\n return x2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":39177,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:27:07","func_code":"def swap_unique_keys_values(x):\n x1 = {}\n x2 = {}\n sorx = sorted(list(x.items()), reverse=True)\n for keys, values in sorx:\n if values not in x1:\n x1[values] = keys\n else:\n x1[values] = 'N'\n sorx2 = sorted(list(x1.items()), revers=True)\n for keys, values in sorx2:\n if values != sorx2:\n x2[keys] = values\n return x2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29397,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:27:19","func_code":"def swap_unique_keys_values(x):\n x1 = {}\n x2 = {}\n sorx = sorted(list(x.items()), reverse=True)\n for keys, values in sorx:\n if values not in x1:\n x1[values] = keys\n else:\n x1[values] = 'N'\n sorx2 = sorted(list(x1.items()), reverse=True)\n for keys, values in sorx2:\n if values != sorx2:\n x2[keys] = values\n return x2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":24931,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:31:38","func_code":"def swap_keys_values(x):\n d = {v: k for k, v in list(x.items())}\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35178,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:31:38","func_code":"def swap_keys_values(x):\n d = {v: k for k, v in list(x.items())}\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":20984,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 18:31:41","func_code":"def swap_unique_keys_values(d):\n q = {}\n a = []\n b = []\n for key in d:\n value = d[key]\n if value not in a:\n a.append(value)\n else:\n b.append(value)\n for key in d:\n value = d[key]\n if value not in b:\n q[value] = key\n a.append(value)\n return q","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":37881,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 18:31:41","func_code":"def swap_unique_keys_values(d):\n q = {}\n a = []\n b = []\n for key in d:\n value = d[key]\n if value not in a:\n a.append(value)\n else:\n b.append(value)\n for key in d:\n value = d[key]\n if value not in b:\n q[value] = key\n a.append(value)\n return q","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":31188,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-01 18:31:41","func_code":"def swap_unique_keys_values(d):\n q = {}\n a = []\n b = []\n for key in d:\n value = d[key]\n if value not in a:\n a.append(value)\n else:\n b.append(value)\n for key in d:\n value = d[key]\n if value not in b:\n q[value] = key\n a.append(value)\n return q","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":23707,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:31:45","func_code":"def swap_unique_keys_values(x):\n x1 = {}\n x2 = {}\n sorx = sorted(list(d.items()), reverse=True)\n for keys, values in sorx:\n if values not in x1:\n x1[values] = keys\n else:\n x1[values] = 'N'\n sorx2 = sorted(list(x1.items()), reverse=True)\n for keys, values in sorx2:\n if values != 'N':\n x2[keys] = values\n return x2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35351,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:32:10","func_code":"def swap_unique_keys_values(x):\n x1 = {}\n x2 = {}\n sorx = sorted(list(x.items()), reverse=True)\n for keys, values in sorx:\n if values not in x1:\n x1[values] = keys\n else:\n x1[values] = 'N'\n sorx2 = sorted(list(x1.items()), reverse=True)\n for keys, values in sorx2:\n if values != 'N':\n x2[keys] = values\n return x2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":33347,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:32:24","func_code":"def swap_unique_keys_values(x):\n x1 = {}\n x2 = {}\n sorx = sorted(list(x.items()), reverse=True)\n for keys, values in sorx:\n if values not in x1:\n x1[values] = keys\n else:\n x1[values] = 'N'\n sorx2 = sorted(list(x1.items()), reverse=True)\n for keys, values in sorx2:\n if values != 'N':\n x2[keys] = values\n return x2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":26390,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-01 18:32:24","func_code":"def swap_unique_keys_values(x):\n x1 = {}\n x2 = {}\n sorx = sorted(list(x.items()), reverse=True)\n for keys, values in sorx:\n if values not in x1:\n x1[values] = keys\n else:\n x1[values] = 'N'\n sorx2 = sorted(list(x1.items()), reverse=True)\n for keys, values in sorx2:\n if values != 'N':\n x2[keys] = values\n return x2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":3017,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-03-01 18:32:25","func_code":"def swap_keys_values(d):\n d = {}\n for k, v in list(d.items()):\n d[v] = k\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":11783,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-03-01 18:32:54","func_code":"def swap_keys_values(d):\n new_d = {val: key for key, val in list(d.items())}\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35563,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-03-01 18:32:54","func_code":"def swap_keys_values(d):\n new_d = {val: key for key, val in list(d.items())}\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":4749,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-03-01 18:32:57","func_code":"def swap_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n nd[v] = k\n return nd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18179,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-03-01 18:32:57","func_code":"def swap_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n nd[v] = k\n return nd","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":22782,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-03-01 18:35:09","func_code":"def swap_unique_keys_values(d):\n nd = {}\n to_delete = []\n for k, v in list(d.items()):\n if v in nd:\n to_delete.append(v)\n else:\n nd[v] = k\n for k in to_delete:\n del nd[k]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":1387,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-03-01 18:35:09","func_code":"def swap_unique_keys_values(d):\n nd = {}\n to_delete = []\n for k, v in list(d.items()):\n if v in nd:\n to_delete.append(v)\n else:\n nd[v] = k\n for k in to_delete:\n del nd[k]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":4001,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-03-01 19:24:08","func_code":"def swap_unique_keys_values(d):\n counter = {}\n for v in list(d.values()):\n counter[v] = counter.get(v, 0) + 1\n unique = {k: v for k, v in list(d.items()) if counter[v] == 1}\n new_d = {val: key for key, val in list(unique.items())}\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":4947,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-03-01 19:24:08","func_code":"def swap_unique_keys_values(d):\n counter = {}\n for v in list(d.values()):\n counter[v] = counter.get(v, 0) + 1\n unique = {k: v for k, v in list(d.items()) if counter[v] == 1}\n new_d = {val: key for key, val in list(unique.items())}\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6218,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-01 19:42:39","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":25475,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-01 19:42:39","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":30951,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-01 19:42:39","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":23402,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 20:27:01","func_code":"def swap_keys_values(d):\n d2 = {}\n for k, v in list(d.items()):\n d2[v] = k\n return d2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":8370,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 20:27:01","func_code":"def swap_keys_values(d):\n d2 = {}\n for k, v in list(d.items()):\n d2[v] = k\n return d2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":2971,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 20:35:22","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n for k, v in list(d.items()):\n if v not in list(d2.values()):\n d2[k] = v\n d3 = {}\n for k, v in list(d2.items()):\n d3[v] = k\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":21155,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 20:36:32","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n for k, v in list(d.items()):\n if v not in list(d2.values()):\n d2[k] = v\n print(d2)\n d3 = {}\n for k, v in list(d2.items()):\n d3[v] = k\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":19638,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 20:36:48","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n for k, v in list(d.items()):\n if v not in list(d2.values()):\n d2[k] = v\n print(d2)\n d3 = {}\n for k, v in list(d2.items()):\n d3[v] = k\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30221,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 20:39:17","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n for k, v in list(d.items()):\n if v not in list(d2.values()):\n d2[k] = v\n else:\n del d2[k]\n print(d2)\n d3 = {}\n for k, v in list(d2.items()):\n d3[v] = k\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":40651,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 20:41:40","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n for k, v in list(d.items()):\n if list(d.values()).count(v) == 1:\n d2[k] = v\n print(d2)\n d3 = {}\n for k, v in list(d2.items()):\n d3[v] = k\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":40098,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 20:44:54","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n for k, v in list(d.items()):\n if v not in list(d2.values()):\n d2[k] = v\n d3 = {}\n for k, v in list(d2.items()):\n if v not in list(d.values()):\n d3[v] = k\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":11147,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 21:09:30","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n for k, v in list(d.items()):\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'X'\n print(d2)","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":34152,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 21:09:44","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n for k, v in list(d.items()):\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'X'\n print(d2)","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":33709,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 21:10:58","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n for k, v in list(d.items()):\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'X'\n for k, v in list(d2.items()):\n if v != 'X':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":579,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 21:10:58","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n for k, v in list(d.items()):\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'X'\n for k, v in list(d2.items()):\n if v != 'X':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":28818,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-01 21:10:58","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n for k, v in list(d.items()):\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'X'\n for k, v in list(d2.items()):\n if v != 'X':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":1952,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-03-01 23:33:57","func_code":"def swap_keys_values(d):\n swappedDict = {}\n for i in d:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14253,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-03-01 23:33:57","func_code":"def swap_keys_values(d):\n swappedDict = {}\n for i in d:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":1778,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-03-01 23:34:48","func_code":"def swap_unique_keys_values(d):\n swappedDict = {}\n for i in d:\n if d[i] in swappedDict:\n del swappedDict[d[i]]\n else:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":13807,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-03-01 23:34:48","func_code":"def swap_unique_keys_values(d):\n swappedDict = {}\n for i in d:\n if d[i] in swappedDict:\n del swappedDict[d[i]]\n else:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":38024,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-01 23:44:23","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key, value in d:\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":9242,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-01 23:53:47","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key, value in list(d.items()):\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":2416,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-01 23:55:42","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key, value in list(d.items()):\n new_dict[d[value]] = d[key]\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":9646,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-01 23:58:19","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key, value in list(d.items()):\n new_dict[value] = d[key]\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":37780,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-01 23:59:39","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key, value in list(d.items()):\n new_dict[value] = key\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35472,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-01 23:59:39","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key, value in list(d.items()):\n new_dict[value] = key\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":38854,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-01 23:59:39","func_code":"def swap_keys_values(d):\n new_dict = {}\n for key, value in list(d.items()):\n new_dict[value] = key\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":16920,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-02 00:12:33","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n keys = []\n values = []\n for key, value in list(d.items()):\n keys.append(value)\n values.append(key)\n return keys, values","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":613,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-03-02 01:46:26","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":13903,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-03-02 01:46:26","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14050,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-03-02 01:48:37","func_code":"def swap_unique_keys_values(d):\n values = list(d.values())\n return {v: k for k, v in list(d.items()) if values.count(v) == 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":18171,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-03-02 01:48:37","func_code":"def swap_unique_keys_values(d):\n values = list(d.values())\n return {v: k for k, v in list(d.items()) if values.count(v) == 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":33854,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-02 10:50:35","func_code":"def swap_keys_values(a):\n newdict = {}\n for l, m in list(a.items()):\n newdict[m] = l\n return newdict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14470,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-02 10:50:35","func_code":"def swap_keys_values(a):\n newdict = {}\n for l, m in list(a.items()):\n newdict[m] = l\n return newdict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":27488,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-02 11:12:00","func_code":"def swap_unique_keys_values(a):\n newdict = {}\n for l, m in list(a.items()):\n if m not in newdict:\n newdict[m] = l\n else:\n del newdict[m]\n return newdict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":16700,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-02 11:12:00","func_code":"def swap_unique_keys_values(a):\n newdict = {}\n for l, m in list(a.items()):\n if m not in newdict:\n newdict[m] = l\n else:\n del newdict[m]\n return newdict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":17913,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-02 11:12:00","func_code":"def swap_unique_keys_values(a):\n newdict = {}\n for l, m in list(a.items()):\n if m not in newdict:\n newdict[m] = l\n else:\n del newdict[m]\n return newdict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6338,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-02 11:33:03","func_code":"def swap_unique_keys_values(d):\n a = {}\n b = {}\n c = sorted(list(d.items()), reverse=True)\n for k, v in c:\n if v not in b:\n b[v] = k\n else:\n b[v] = 'A'\n e = sorted(list(a.items()), reverse=True)\n for k, v in e:\n if v != 'A':\n b = v\n return b","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30289,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-02 11:39:51","func_code":"def swap_unique_keys_values(d):\n a2 = {}\n a3 = {}\n ar = sorted(list(d.items()), reverse=True)\n for k, v in ar:\n if v not in a2:\n a2[v] = k\n else:\n a2[v] = 'N'\n ar2 = sorted(list(a2.items()), reverse=True)\n for k, v in ar2:\n if v != 'N':\n a3[k] = v\n return a3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":26561,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-02 11:39:51","func_code":"def swap_unique_keys_values(d):\n a2 = {}\n a3 = {}\n ar = sorted(list(d.items()), reverse=True)\n for k, v in ar:\n if v not in a2:\n a2[v] = k\n else:\n a2[v] = 'N'\n ar2 = sorted(list(a2.items()), reverse=True)\n for k, v in ar2:\n if v != 'N':\n a3[k] = v\n return a3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":988,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-02 11:58:06","func_code":"def swap_keys_values(d):\n a2 = {}\n a3 = {}\n ar = sorted(list(d.items()), reverse=True)\n for k, v in ar:\n a2[v] = k\n ar2 = sorted(list(a2.items()), reverse=True)\n for k, v in ar2:\n a3[k] = v\n return a3","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":38562,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-02 11:58:06","func_code":"def swap_keys_values(d):\n a2 = {}\n a3 = {}\n ar = sorted(list(d.items()), reverse=True)\n for k, v in ar:\n a2[v] = k\n ar2 = sorted(list(a2.items()), reverse=True)\n for k, v in ar2:\n a3[k] = v\n return a3","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":35304,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-03-02 12:26:41","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":5097,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-03-02 12:26:41","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":31934,"user":"68f143f9-a076-4b95-afe1-e3828c2d0f4e","date":"2018-03-02 12:29:05","func_code":"def swap_keys_values(d):\n return {d[key]: key for key in d}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":27287,"user":"68f143f9-a076-4b95-afe1-e3828c2d0f4e","date":"2018-03-02 12:29:05","func_code":"def swap_keys_values(d):\n return {d[key]: key for key in d}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":27792,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-03-02 12:29:52","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":11136,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-03-02 12:29:52","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":10090,"user":"68f143f9-a076-4b95-afe1-e3828c2d0f4e","date":"2018-03-02 12:30:19","func_code":"def swap_unique_keys_values(d):\n return dict([(v, k) for k, v in list(d.items()) if list(d.values()).\n count(v) == 1])","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":42098,"user":"68f143f9-a076-4b95-afe1-e3828c2d0f4e","date":"2018-03-02 12:30:19","func_code":"def swap_unique_keys_values(d):\n return dict([(v, k) for k, v in list(d.items()) if list(d.values()).\n count(v) == 1])","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":32106,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-03-02 12:32:19","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[k] = v\n else:\n d2[v] = 'N'\n d2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29018,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-03-02 12:33:34","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[k] = v\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":8100,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-03-02 12:37:13","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n if not v in nd:\n nd[v] = k\n else:\n del nd[v]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":19077,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-03-02 12:37:13","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n if not v in nd:\n nd[v] = k\n else:\n del nd[v]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35909,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-03-02 12:37:13","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for k, v in list(d.items()):\n if not v in nd:\n nd[v] = k\n else:\n del nd[v]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":23451,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-03-02 12:38:32","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[k] = v\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":20717,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-03-02 12:39:15","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[k] = v\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30661,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-03-02 12:41:21","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v in d2:\n d2[v] = 'N'\n else:\n d2[v] = k\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29690,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-03-02 12:41:57","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v in d2:\n d2[v] = 'N'\n else:\n d2[v] = k\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":17518,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-03-02 12:41:57","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v in d2:\n d2[v] = 'N'\n else:\n d2[v] = k\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35267,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-02 13:12:57","func_code":"def swap_keys_values(d):\n new_dict = {v: k for k, v in list(d.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":24375,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-02 13:12:57","func_code":"def swap_keys_values(d):\n new_dict = {v: k for k, v in list(d.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":13994,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:14:41","func_code":"def swap_keys_values(s):\n dic = {}\n for key, value in s.item():\n dic[value] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":8922,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:15:28","func_code":"def swap_keys_values(s):\n new_dict = {}\n for key, value in list(s.items()):\n new_dict[value] = key\n return new_dictict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":23072,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:15:46","func_code":"def swap_keys_values(s):\n new_dict = {}\n for key, value in list(s.items()):\n new_dict[value] = key\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":26603,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-02 13:18:34","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = []\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = kd\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":1349,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-02 13:19:24","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = []\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":11044,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-02 13:21:04","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":25129,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-02 13:21:04","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":15498,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-02 13:21:04","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35626,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:25:33","func_code":"def swap_keys_values(s):\n new_dict = {}\n for key, value in list(s.items()):\n new_dict[value] = key\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":39439,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:25:33","func_code":"def swap_keys_values(s):\n new_dict = {}\n for key, value in list(s.items()):\n new_dict[value] = key\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":7774,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:25:58","func_code":"def swap_unique_keys_values(s):\n new_dict = {}\n for key, value in list(s.items()):\n if s[key] not in new_dict:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":42385,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:29:26","func_code":"def swap_unique_keys_values(s):\n new_dict = {}\n for key, value in list(s.items()):\n if s[key] not in s:\n new_dict[value] = key\n for key, value in new_dict:\n if new_dict[key] in s:\n del new_dict[key]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6443,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-03-02 13:30:32","func_code":"def swap_keys_values(dictionary):\n new_dictionary = {}\n for key in dictionary:\n new_dictionary[dictionary[key]] = key\n return new_dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":12508,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-03-02 13:30:32","func_code":"def swap_keys_values(dictionary):\n new_dictionary = {}\n for key in dictionary:\n new_dictionary[dictionary[key]] = key\n return new_dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":40319,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-03-02 13:30:38","func_code":"def swap_unique_keys_values(dictionary):\n values = []\n new_dict = {}\n for key in dictionary:\n values.append(dictionary[key])\n for key, value in list(dictionary.items()):\n if values.count(value) == 1:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":1960,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-03-02 13:30:38","func_code":"def swap_unique_keys_values(dictionary):\n values = []\n new_dict = {}\n for key in dictionary:\n values.append(dictionary[key])\n for key, value in list(dictionary.items()):\n if values.count(value) == 1:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":38084,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-03-02 13:30:38","func_code":"def swap_unique_keys_values(dictionary):\n values = []\n new_dict = {}\n for key in dictionary:\n values.append(dictionary[key])\n for key, value in list(dictionary.items()):\n if values.count(value) == 1:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":40766,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:31:27","func_code":"def swap_unique_keys_values(s):\n new_dict = {}\n for key, value in list(s.items()):\n if s.count(s[key]) == 1:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35297,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 13:42:28","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":3311,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 13:42:28","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":7158,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:42:41","func_code":"def swap_unique_keys_values(s):\n new_dict = {}\n c = Counter(list(s.values()))\n l = [k for k, v in list(s.items()) if c[v] < 2]\n for key, value in list(s.items()):\n if s[key] in l:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30632,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:42:58","func_code":"def swap_unique_keys_values(s):\n new_dict = {}\n c = Counter(list(s.values()))\n l = [k for k, v in list(s.items()) if c[v] < 2]\n for key, value in list(s.items()):\n if s[key] not in l:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":34331,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:43:54","func_code":"def swap_unique_keys_values(s):\n new_dict = {}\n c = Counter(list(s.values()))\n l = [k for k, v in list(s.items()) if c[v] == 1]\n for key, value in list(s.items()):\n if s[key] in l:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":25140,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:44:13","func_code":"def swap_unique_keys_values(s):\n new_dict = {}\n c = Counter(list(s.values()))\n l = [k for k, v in list(s.items()) if c[v] == 1]\n print(l)\n for key, value in list(s.items()):\n if s[key] in l:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":33151,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:44:31","func_code":"def swap_unique_keys_values(s):\n new_dict = {}\n c = Counter(list(s.values()))\n l = [k for k, v in list(s.items()) if c[v] == 1]\n print(l)\n for key, value in list(s.items()):\n if s[key] in l:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30347,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:45:19","func_code":"def swap_unique_keys_values(s):\n new_dict = {}\n c = Counter(list(s.values()))\n l = [k for k, v in list(s.items()) if c[v] == 1]\n print(l)\n for key, value in list(s.items()):\n if key in l:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":42383,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:45:34","func_code":"def swap_unique_keys_values(s):\n new_dict = {}\n c = Counter(list(s.values()))\n l = [k for k, v in list(s.items()) if c[v] == 1]\n for key, value in list(s.items()):\n if key in l:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35186,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-02 13:45:34","func_code":"def swap_unique_keys_values(s):\n new_dict = {}\n c = Counter(list(s.values()))\n l = [k for k, v in list(s.items()) if c[v] == 1]\n for key, value in list(s.items()):\n if key in l:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":24505,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 13:52:55","func_code":"def swap_unique_keys_values(d):\n e = {}\n for left, right in d:\n if right not in e:\n e[left] = right\n return {v: k for k, v in list(e.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":36211,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 13:53:46","func_code":"def swap_unique_keys_values(d):\n e = {}\n for s in d:\n if d[s] not in e:\n e[s] = d[s]\n return {v: k for k, v in list(e.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":24040,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 13:55:07","func_code":"def swap_unique_keys_values(d):\n e = {}\n for s in d:\n if d[s] and s not in e:\n e[s] = d[s]\n return {v: k for k, v in list(e.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":19332,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 13:55:37","func_code":"def swap_unique_keys_values(d):\n e = {}\n for s in d:\n if d[s] and s not in e:\n e[s] = d[s]\n print(d[s])\n return {v: k for k, v in list(e.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":27409,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 13:55:49","func_code":"def swap_unique_keys_values(d):\n e = {}\n for s in d:\n if d[s] and s not in e:\n e[s] = d[s]\n print(d[s])\n return {v: k for k, v in list(e.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":23419,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 13:58:19","func_code":"def swap_unique_keys_values(d):\n e = {}\n for s in d:\n if d[s] not in e:\n e[s] = d[s]\n elif d[s] in e:\n del s\n return {v: k for k, v in list(e.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":14914,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 13:58:40","func_code":"def swap_unique_keys_values(d):\n e = {}\n for s in d:\n if d[s] not in e:\n e[s] = d[s]\n elif d[s] in e:\n del s\n print(e)\n return {v: k for k, v in list(e.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":826,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 13:59:02","func_code":"def swap_unique_keys_values(d):\n e = {}\n for s in d:\n if d[s] not in e:\n e[s] = d[s]\n elif d[s] in e:\n del d[s]\n print(e)\n return {v: k for k, v in list(e.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":16389,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 14:03:18","func_code":"def swap_unique_keys_values(d):\n e = {}\n for s in d:\n if d[s] not in e:\n e[s] = d[s]\n elif d[s] in e:\n e.remove(s)\n print(e)\n return {v: k for k, v in list(e.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":26944,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 14:04:27","func_code":"def swap_unique_keys_values(d):\n e = {}\n for s in d:\n if d[s] in d:\n d.remove(s)\n print(d)\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":9706,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 14:13:56","func_code":"def swap_unique_keys_values(d):\n e = {}\n h = {}\n for k, v in d:\n if v in e:\n e[k] = v\n else:\n e[k] = 'n'\n for k, v in e:\n if v != 'n':\n h[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":34599,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-02 14:13:56","func_code":"def swap_unique_keys_values(d):\n e = {}\n h = {}\n for k, v in d:\n if v in e:\n e[k] = v\n else:\n e[k] = 'n'\n for k, v in e:\n if v != 'n':\n h[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":9185,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-02 14:17:08","func_code":"def swap_keys_values(d):\n d_swap = {}\n for x in d:\n d_swap[d[x]] = x\n return d_swap","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":30053,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-02 14:17:08","func_code":"def swap_keys_values(d):\n d_swap = {}\n for x in d:\n d_swap[d[x]] = x\n return d_swap","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":7770,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-02 14:20:27","func_code":"def swap_unique_keys_values(d):\n d_swap = {}\n for x in d:\n if d[x] not in d_swap:\n d_swap[d[x]] = x\n return d_swap","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":8456,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-02 14:26:37","func_code":"def swap_unique_keys_values(d):\n d_swap = {}\n d_tmp = {}\n for x in d:\n d_swap[d[x]] = x\n return d_swap","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":39260,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-02 14:30:22","func_code":"def swap_unique_keys_values(d):\n d_swap = {}\n for x in d:\n d_swap[d[x]] = x\n if d[x] in d_swap:\n del d_swap[d[x]]\n return d_swap","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":8700,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-02 14:31:04","func_code":"def swap_unique_keys_values(d):\n d_swap = {}\n for x in d:\n if d[x] in d_swap:\n del d_swap[d[x]]\n else:\n d_swap[d[x]] = x\n return d_swap","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":7552,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-02 14:31:04","func_code":"def swap_unique_keys_values(d):\n d_swap = {}\n for x in d:\n if d[x] in d_swap:\n del d_swap[d[x]]\n else:\n d_swap[d[x]] = x\n return d_swap","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":2389,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-02 14:31:04","func_code":"def swap_unique_keys_values(d):\n d_swap = {}\n for x in d:\n if d[x] in d_swap:\n del d_swap[d[x]]\n else:\n d_swap[d[x]] = x\n return d_swap","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":22495,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-02 15:49:06","func_code":"def swap_keys_values(d):\n new = {}\n for k, v in list(d.items()):\n new[v] = k\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":23698,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-02 15:49:53","func_code":"def swap_keys_values(d):\n new = {}\n for k, v in list(d.items()):\n new[v] = k\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":828,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-02 16:05:27","func_code":"def swap_keys_values(d):\n new = {}\n for k, v in list(d.items()):\n new[v] = k\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":3618,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-02 16:05:44","func_code":"def swap_keys_values(d):\n new = {}\n for k, v in list(d.items()):\n new[v] = k\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35142,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-02 16:05:44","func_code":"def swap_keys_values(d):\n new = {}\n for k, v in list(d.items()):\n new[v] = k\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":26820,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-02 16:05:44","func_code":"def swap_keys_values(d):\n new = {}\n for k, v in list(d.items()):\n new[v] = k\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":5934,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-02 17:36:04","func_code":"def swap_unique_keys_values(my_dict):\n dic = {}\n for key, value in list(my_dict.items()):\n if value in dic:\n del dic[value]\n else:\n dic[value] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":27553,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-02 17:36:04","func_code":"def swap_unique_keys_values(my_dict):\n dic = {}\n for key, value in list(my_dict.items()):\n if value in dic:\n del dic[value]\n else:\n dic[value] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":15869,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-02 22:33:28","func_code":"def swap_unique_keys_values(d):\n return {(b, a) for a, b in list(d.items()) if list(d.values()).count(b) ==\n 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6492,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-02 22:33:49","func_code":"def swap_unique_keys_values(d):\n return {[(b, a) for a, b in list(d.items()) if list(d.values()).count(b\n ) == 1]}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29549,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-02 22:33:49","func_code":"def swap_unique_keys_values(d):\n return {[(b, a) for a, b in list(d.items()) if list(d.values()).count(b\n ) == 1]}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":867,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-02 22:33:49","func_code":"def swap_unique_keys_values(d):\n return {[(b, a) for a, b in list(d.items()) if list(d.values()).count(b\n ) == 1]}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":11721,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-04 13:20:15","func_code":"def swap_unique_keys_values():\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":39693,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-04 13:20:36","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":39692,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-04 13:20:36","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":33671,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-04 13:20:36","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35912,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-03-04 13:40:20","func_code":"def swap_keys_values(d):\n dic = {}\n for k, v in list(d.items()):\n dic[v] = k\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":37812,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-03-04 13:40:20","func_code":"def swap_keys_values(d):\n dic = {}\n for k, v in list(d.items()):\n dic[v] = k\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":20257,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-03-04 13:46:59","func_code":"def swap_unique_keys_values(d):\n dic = {}\n for k, v in list(d.items()):\n if v not in dic:\n dic[v] = k\n else:\n del dic[v]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6501,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-03-04 13:46:59","func_code":"def swap_unique_keys_values(d):\n dic = {}\n for k, v in list(d.items()):\n if v not in dic:\n dic[v] = k\n else:\n del dic[v]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":36757,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-03-04 13:46:59","func_code":"def swap_unique_keys_values(d):\n dic = {}\n for k, v in list(d.items()):\n if v not in dic:\n dic[v] = k\n else:\n del dic[v]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":19797,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-03-04 18:05:03","func_code":"def swap_keys_values(dic):\n keys = list(dic.keys())\n vals = list(dic.values())\n newdic = {}\n i = 0\n for val in vals:\n newdic[val] = keys[i]\n i += 1\n return newdic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":1346,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-03-04 18:05:03","func_code":"def swap_keys_values(dic):\n keys = list(dic.keys())\n vals = list(dic.values())\n newdic = {}\n i = 0\n for val in vals:\n newdic[val] = keys[i]\n i += 1\n return newdic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":10532,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-03-04 18:10:35","func_code":"def swap_unique_keys_values(dic):\n keys = list(dic.keys())\n vals = list(dic.values())\n newdic = {}\n i = 0\n for val in vals:\n if vals.count(val) == 1:\n newdic[val] = keys[i]\n i += 1\n return newdic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":4275,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-03-04 18:10:35","func_code":"def swap_unique_keys_values(dic):\n keys = list(dic.keys())\n vals = list(dic.values())\n newdic = {}\n i = 0\n for val in vals:\n if vals.count(val) == 1:\n newdic[val] = keys[i]\n i += 1\n return newdic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":21208,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-03-04 18:10:35","func_code":"def swap_unique_keys_values(dic):\n keys = list(dic.keys())\n vals = list(dic.values())\n newdic = {}\n i = 0\n for val in vals:\n if vals.count(val) == 1:\n newdic[val] = keys[i]\n i += 1\n return newdic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":20940,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-03-05 13:06:25","func_code":"def swap_keys_values(d):\n d2 = {}\n for k, v in list(d.items()):\n d2[v] = k\n return d2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":5993,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-03-05 13:06:25","func_code":"def swap_keys_values(d):\n d2 = {}\n for k, v in list(d.items()):\n d2[v] = k\n return d2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":12406,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-03-05 16:11:45","func_code":"def swap_keys_values(dic):\n return {val: key for key, val in list(dic.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35282,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-03-05 16:11:45","func_code":"def swap_keys_values(dic):\n return {val: key for key, val in list(dic.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":12822,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-03-05 16:17:53","func_code":"def swap_unique_keys_values(dic):\n new = {}\n new = {val: key for key, val in list(dic.items())}\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6194,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-03-05 20:59:24","func_code":"def swap_unique_keys_values(d):\n lst = []\n for k in list(d.keys()):\n v = d[k]\n lst.append(v)\n new_d = {v: k for k, v in list(d.items()) if lst.count(v, 0, len(lst)) == 1\n }\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":25180,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-03-05 21:00:08","func_code":"def swap_unique_keys_values(d):\n lst = []\n for k in list(d.keys()):\n v = d[k]\n lst.append(v)\n new_d = {v: k for k, v in list(d.items()) if lst.count(v) == 1}\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":31831,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-03-05 21:00:08","func_code":"def swap_unique_keys_values(d):\n lst = []\n for k in list(d.keys()):\n v = d[k]\n lst.append(v)\n new_d = {v: k for k, v in list(d.items()) if lst.count(v) == 1}\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":27707,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-03-05 21:21:06","func_code":"def swap_unique_keys_values(d):\n a = [v for v in list(d.values())]\n a = [v for v in a if a.count(v) == 1]\n return {v: k for k, v in list(d.items()) if v in a}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":30332,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-03-05 21:21:06","func_code":"def swap_unique_keys_values(d):\n a = [v for v in list(d.values())]\n a = [v for v in a if a.count(v) == 1]\n return {v: k for k, v in list(d.items()) if v in a}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35844,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-03-05 21:21:06","func_code":"def swap_unique_keys_values(d):\n a = [v for v in list(d.values())]\n a = [v for v in a if a.count(v) == 1]\n return {v: k for k, v in list(d.items()) if v in a}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35857,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-05 23:23:39","func_code":"def swap_keys_values(d):\n keys = []\n vals = []\n new_d = {}\n for k, v in list(d.items()):\n keys.append(v)\n vals.append(k)\n y = 0\n for x in keys:\n new_d[x] = vals[y]\n y = y + 1\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14761,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-05 23:23:39","func_code":"def swap_keys_values(d):\n keys = []\n vals = []\n new_d = {}\n for k, v in list(d.items()):\n keys.append(v)\n vals.append(k)\n y = 0\n for x in keys:\n new_d[x] = vals[y]\n y = y + 1\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":17251,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-05 23:23:39","func_code":"def swap_keys_values(d):\n keys = []\n vals = []\n new_d = {}\n for k, v in list(d.items()):\n keys.append(v)\n vals.append(k)\n y = 0\n for x in keys:\n new_d[x] = vals[y]\n y = y + 1\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":37302,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-05 23:23:46","func_code":"def swap_keys_values(d):\n new_dict = {v: k for k, v in list(d.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":554,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-05 23:23:46","func_code":"def swap_keys_values(d):\n new_dict = {v: k for k, v in list(d.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":7698,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-05 23:23:46","func_code":"def swap_keys_values(d):\n new_dict = {v: k for k, v in list(d.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":37672,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-05 23:29:24","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n return sen","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13796,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-05 23:29:24","func_code":"def remove_zeros(nums):\n gway = []\n i = 0\n while i < len(nums):\n if int(nums[i]) == 0:\n del nums[i]\n if int(nums[i]) == 0:\n del nums[i]\n i = i + 1\n return nums","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":25700,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-05 23:29:24","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n return sen","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18596,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-05 23:29:24","func_code":"def weird_case(some_str):\n sen = ''\n i = True\n for letter in some_str:\n if i:\n sen += letter.upper()\n else:\n sen += letter.lower()\n if letter != ' ':\n i = not i\n return sen","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":7799,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-05 23:29:24","func_code":"def remove_zeros(nums):\n gway = []\n i = 0\n while i < len(nums):\n if int(nums[i]) == 0:\n del nums[i]\n if int(nums[i]) == 0:\n del nums[i]\n i = i + 1\n return nums","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":11124,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-05 23:29:24","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(0, len(l1), 2):\n l3.append(l1[token])\n for i in range(0, len(l2), 2):\n l3.append(l2[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33419,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-05 23:29:24","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(0, len(l1), 2):\n l3.append(l1[token])\n for i in range(0, len(l2), 2):\n l3.append(l2[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":10304,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-05 23:29:24","func_code":"def merge_lists(l1, l2):\n l3 = []\n for token in range(0, len(l1), 2):\n l3.append(l1[token])\n for i in range(0, len(l2), 2):\n l3.append(l2[i])\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18850,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-05 23:29:24","func_code":"def remove_zeros(nums):\n gway = []\n i = 0\n while i < len(nums):\n if int(nums[i]) == 0:\n del nums[i]\n if int(nums[i]) == 0:\n del nums[i]\n i = i + 1\n return nums","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":18024,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-06 02:52:58","func_code":"def swap_unique_keys_values(d):\n keys = []\n new_d = {}\n old_vals = list(d.values())\n unique_vals = [v for v in old_vals if old_vals.count(v) < 2]\n for k, v in list(d.items()):\n if v in unique_vals:\n keys.append(k)\n new_keys = unique_vals\n new_vals = keys\n y = 0\n for x in new_keys:\n new_d[x] = new_vals[y]\n y = y + 1\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6277,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-06 02:52:58","func_code":"def swap_unique_keys_values(d):\n keys = []\n new_d = {}\n old_vals = list(d.values())\n unique_vals = [v for v in old_vals if old_vals.count(v) < 2]\n for k, v in list(d.items()):\n if v in unique_vals:\n keys.append(k)\n new_keys = unique_vals\n new_vals = keys\n y = 0\n for x in new_keys:\n new_d[x] = new_vals[y]\n y = y + 1\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":22490,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-06 12:47:25","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":29265,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-06 12:47:25","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":26311,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-06 12:49:48","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in new_d:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":21798,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-06 12:54:36","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in new_d:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":3808,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-06 15:13:21","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":34941,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-06 15:13:21","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":40109,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-06 15:44:55","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n new_dict = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n new_dict[values[i]] = keys[i]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":17973,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-06 15:44:55","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n new_dict = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n new_dict[values[i]] = keys[i]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":42293,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-06 15:44:55","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n new_dict = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n new_dict[values[i]] = keys[i]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":32038,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-06 16:06:32","func_code":"def swap_keys_values(d):\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":9322,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-06 16:06:32","func_code":"def swap_keys_values(d):\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":473,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-06 16:07:50","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n seen = []\n for v in list(d.values()):\n if v not in seen:\n seen.append(v)\n elif v in seen:\n seen.remove(v)\n for k, v in list(d.items()):\n if v in seen:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":36359,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-06 16:07:50","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n seen = []\n for v in list(d.values()):\n if v not in seen:\n seen.append(v)\n elif v in seen:\n seen.remove(v)\n for k, v in list(d.items()):\n if v in seen:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":34102,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-06 16:07:58","func_code":"def swap_unique_keys_values(d):\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":10351,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-06 16:22:12","func_code":"def swap_unique_keys_values(d):\n d = dict(set(d))\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":28537,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-06 16:22:12","func_code":"def swap_unique_keys_values(d):\n d = dict(set(d))\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":39040,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-06 16:22:12","func_code":"def swap_unique_keys_values(d):\n d = dict(set(d))\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":21200,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:15:00","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 1 == 0:\n sent[i] = sent[i].upper()\n i += 1\n i += 1\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21418,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:15:00","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":35132,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:15:00","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2404,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:15:44","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7710,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:15:44","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 2 == 0:\n sent[i] = sent[i].upper()\n i += 1\n i += 1\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29394,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:15:44","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":41734,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:22:47","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35335,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:22:47","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 1 == 0:\n sent[i] = sent[i].upper()\n i += 1\n i += 1\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13482,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:22:47","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":37991,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:23:40","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 1 == 0:\n sent[i] = sent[i].upper()\n i += 2\n i += 2\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28752,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:23:40","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12259,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:23:40","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":34245,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:24:17","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":41100,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:24:17","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 2 == 0:\n sent[i] = sent[i].upper()\n i += 2\n i += 2\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15713,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:24:17","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":10128,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:25:09","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38627,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:25:09","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 2 == 0:\n sent[i] = sent[i].upper()\n i += 1\n i += 1\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31977,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:25:09","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18672,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:25:09","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 2 == 0:\n sent[i] = sent[i].upper()\n i += 1\n i += 1\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18170,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:25:09","func_code":"def weird_case(some_str):\n some_str = some_str.lower()\n sent = list(some_str)\n i = 0\n while i < len(sent):\n if sent[i].isalpha() and i % 2 == 0:\n sent[i] = sent[i].upper()\n i += 1\n i += 1\n return ''.join(sent)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19648,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:25:09","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37542,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:25:09","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":4880,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:25:09","func_code":"def merge_lists(l1, l2):\n end_list = []\n i = 0\n while i < len(l1):\n end_list.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n end_list.append(l2[i])\n i += 2\n return end_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11363,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-06 18:25:09","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n list.remove(list[i])\n i += 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":11128,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 22:37:36","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":41680,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 22:44:38","func_code":"def weird_case(some_str):\n import sys\n upper_list = ()\n some_str = sys.stdin.readline()\n letters = some_str.strip('\\n').split(' ')\n i = 0\n while i < len(letters):\n if i % 2 == 1 and i != 0:\n letters[i].upper()\n i = 1 + i\n upper_list.append(letters)\n return upper_list","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":31048,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 22:44:38","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31630,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 22:47:51","func_code":"def weird_case(some_str):\n import sys\n upper_str = ()\n some_str = sys.stdin.readline()\n letters = some_str.strip('\\n').split(' ')\n i = 0\n while i < len(letters):\n if i % 2 == 1 and i != 0:\n letters[i] = letters[i].upper()\n i = 1 + i\n upper_str.append(letters)\n return upper_list","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22102,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 22:47:51","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":27732,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 22:58:56","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return A.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11009,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 22:58:56","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":5617,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 22:59:23","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":16787,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 22:59:23","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11804,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:06:31","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":8406,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:06:31","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22833,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:06:31","func_code":"def remove_zeros(list):\n i = 0\n while i < len[a]:\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i + 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":19193,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:07:07","func_code":"def remove_zeros(list):\n a = []\n i = 0\n while i < len[a]:\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i + 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":19189,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:07:07","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":11456,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:07:07","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":3406,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:07:21","func_code":"def remove_zeros(list):\n b = []\n i = 0\n while i < len[a]:\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i + 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":2278,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:07:21","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27094,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:07:21","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":32470,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:07:58","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":14038,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:07:58","func_code":"def remove_zeros(a):\n i = 0\n while i < len[a]:\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i + 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":31408,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:07:58","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40530,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:08:57","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":36250,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:08:57","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31243,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:08:57","func_code":"def remove_zeros(list):\n i = 0\n while i < len[a]:\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":5701,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:09:50","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":13269,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:09:50","func_code":"def remove_zeros(list):\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":8885,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:09:50","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":7254,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:10:49","func_code":"def remove_zeros(list):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":10142,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:10:49","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":17132,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:10:49","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":40395,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:11:03","func_code":"def remove_zeros(list):\n a = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":39977,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:11:03","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33342,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:11:03","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25624,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:12:05","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14396,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:12:05","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":36449,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:12:05","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13130,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:12:05","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28496,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:12:05","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":41492,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:12:05","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":41115,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:12:05","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":42272,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:12:05","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":19164,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-06 23:12:05","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":30281,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:47:03","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":39958,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:47:37","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":26253,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:48:04","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":14899,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:48:47","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":27907,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:50:26","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":32819,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:50:57","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":37161,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:51:30","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":30905,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:52:32","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":12289,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:53:10","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":13206,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:53:29","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":13557,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:54:28","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":34588,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:55:19","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22844,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:56:03","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":17182,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:58:14","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":36942,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:58:38","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":27028,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:59:02","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22443,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:59:39","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":32808,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:59:39","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":16245,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-06 23:59:39","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:01:24","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":16228,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:17:32","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22473,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:18:01","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":37106,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:18:34","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":22331,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:19:05","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":35141,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:19:55","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":35639,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:20:39","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i][::2]).split(',')\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i][::2]).split(',')\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33456,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:21:14","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])[::2]\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])[::2]\n i = i + 1\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":31307,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:22:02","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35819,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:22:41","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i]).split(',')\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":9260,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:23:05","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i]).split\n i = i + 1\n return l3[::2].split(',')","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":36813,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:23:43","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2].split(',')","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":11690,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:24:18","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i]).split()\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i]).split()\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":37904,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:24:42","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":4672,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:26:51","func_code":"def merge_lists(l1, l2):\n l3 = [].split(',')\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":18220,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 00:28:42","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3 = l3.split(',')\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":33764,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 10:05:56","func_code":"def merge_lists(l1, l2):\n l3 = []\n my_list = l3.split(',')\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return my_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":38047,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-07 10:14:57","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":25262,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-07 10:14:57","func_code":"def merge_lists(l1, l2):\n i = 0\n mergedlist = []\n while i < len(l1):\n mergedlist.append(l1[i])\n i = i + 2\n j = 0\n while i < len(l2):\n mergedlist.append(l2[j])\n j = j + 2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":30102,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-07 10:14:57","func_code":"def weird_case(some_str):\n ret = ''\n i = True\n for char in some_str:\n if i:\n ret += char.upper()\n else:\n ret += char.lower()\n if char != ' ':\n i = not i\n return ret","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21614,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-07 10:16:06","func_code":"def weird_case(some_str):\n ret = ''\n i = True\n for char in some_str:\n if i:\n ret += char.upper()\n else:\n ret += char.lower()\n if char != ' ':\n i = not i\n return ret","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27386,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-07 10:16:06","func_code":"def merge_lists(l1, l2):\n i = 0\n mergedlist = []\n while i < len(l1):\n mergedlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n mergedlist.append(l2[j])\n j = j + 2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":1005,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-07 10:16:06","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":2305,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-07 10:16:06","func_code":"def weird_case(some_str):\n ret = ''\n i = True\n for char in some_str:\n if i:\n ret += char.upper()\n else:\n ret += char.lower()\n if char != ' ':\n i = not i\n return ret","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":9145,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-07 10:16:06","func_code":"def merge_lists(l1, l2):\n i = 0\n mergedlist = []\n while i < len(l1):\n mergedlist.append(l1[i])\n i = i + 2\n j = 0\n while j < len(l2):\n mergedlist.append(l2[j])\n j = j + 2\n return mergedlist","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9573,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-07 10:16:06","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if 0 in list:\n list.remove(0)\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":15570,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 10:27:37","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2].rstrip()","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":8727,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 10:28:02","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24683,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-07 10:28:02","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28840,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 11:35:07","func_code":"def swap_keys_values(d):\n inv_map = {a: b for b, a in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":29286,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 11:36:53","func_code":"def swap_keys_values(d):\n inv_map = {a: b for b, a in list(d.items())}\n return inv_map","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":9732,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 11:36:53","func_code":"def swap_keys_values(d):\n inv_map = {a: b for b, a in list(d.items())}\n return inv_map","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":19073,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 11:39:28","func_code":"def swap_unique_keys_values(d):\n inv_map = {a: b for b, a in list(d.items())}\n return inv_map","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":34508,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 11:45:46","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in new:\n new[key] = value\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":37153,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 11:47:06","func_code":"def swap_unique_keys_values(d):\n seen = []\n new = {}\n for key, value in list(d.items()):\n if value not in seen:\n value.append(seen)\n new[key] = value\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":9370,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 11:47:45","func_code":"def swap_unique_keys_values(d):\n seen = []\n new = {}\n for key, value in list(d.items()):\n if value not in seen:\n seen.append(value)\n new[key] = value\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":5068,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 11:50:19","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(new.values()):\n new[key] = value\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":37244,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-03-07 12:06:40","func_code":"def swap_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append(file)\n for letter in a:\n c[dic[letter]] = letter\n return c","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":41727,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-03-07 12:06:40","func_code":"def swap_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append(file)\n for letter in a:\n c[dic[letter]] = letter\n return c","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":19590,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-03-07 12:09:23","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append([file, dic[file]])\n for letter in a:\n if letter[1] in c:\n del c[letter[1]]\n else:\n c[letter[1]] = letter[0]\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":30786,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-03-07 12:09:23","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append([file, dic[file]])\n for letter in a:\n if letter[1] in c:\n del c[letter[1]]\n else:\n c[letter[1]] = letter[0]\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":20653,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-03-07 14:56:07","func_code":"def swap_keys_values(d):\n swp_d = {}\n for lines in d:\n swp_d[d[lines]] = lines\n return swp_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":26479,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-03-07 14:56:07","func_code":"def swap_keys_values(d):\n swp_d = {}\n for lines in d:\n swp_d[d[lines]] = lines\n return swp_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21956,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 15:52:09","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(new.values()):\n new[key] = value\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":38687,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 15:52:58","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(new.values()):\n print(value)\n new[key] = value\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":33495,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 15:57:17","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(new.values()):\n new[key] = value\n if value in list(new.values()):\n del d[key]\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":8493,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 15:58:31","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(new.values()):\n new[key] = value\n else:\n del new[key]\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35509,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 16:00:07","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value in list(new.values()):\n del new[key]\n elif value not in list(new.values()):\n new[key] = value\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":7586,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 16:02:50","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value in list(new.values()):\n del new[key, value]\n elif value not in list(new.values()):\n new[key] = value\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35476,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 16:05:11","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(d.values()):\n new[key] = value\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":16291,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 16:08:17","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n d.pop(key, value)\n if value not in list(d.values()):\n new[key] = value\n inverse = {a: b for b, a in list(new.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6150,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 16:11:16","func_code":"def swap_unique_keys_values(d):\n output = {}\n new = d\n for key, value in list(new.items()):\n new.pop(key, value)\n if value not in list(new.values()):\n output[key] = value\n inverse = {a: b for b, a in list(output.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":4291,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 16:14:23","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(d.values()):\n new[key] = value\n for key, value in list(new.items()):\n del d[key, value]\n output = {}\n for key, value in list(new.items()):\n if value not in list(d.values()):\n output[key] = value\n inverse = {a: b for b, a in list(output.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":4163,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 16:15:32","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(d.values()):\n new[key] = value\n print((d, new))\n for key, value in list(new.items()):\n del d[key, value]\n print((d, new))\n output = {}\n for key, value in list(new.items()):\n if value not in list(d.values()):\n output[key] = value\n inverse = {a: b for b, a in list(output.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6878,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 16:16:04","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(new.values()):\n new[key] = value\n print((d, new))\n for key, value in list(new.items()):\n del d[key, value]\n print((d, new))\n output = {}\n for key, value in list(new.items()):\n if value not in list(d.values()):\n output[key] = value\n inverse = {a: b for b, a in list(output.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":16577,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 16:16:38","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(new.values()):\n new[key] = value\n print((d, new))\n for key, value in list(new.items()):\n d.pop(key, value)\n print((d, new))\n output = {}\n for key, value in list(new.items()):\n if value not in list(d.values()):\n output[key] = value\n inverse = {a: b for b, a in list(output.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":19601,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 16:16:56","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(new.values()):\n new[key] = value\n for key, value in list(new.items()):\n d.pop(key, value)\n output = {}\n for key, value in list(new.items()):\n if value not in list(d.values()):\n output[key] = value\n inverse = {a: b for b, a in list(output.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":32628,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-07 16:16:56","func_code":"def swap_unique_keys_values(d):\n new = {}\n for key, value in list(d.items()):\n if value not in list(new.values()):\n new[key] = value\n for key, value in list(new.items()):\n d.pop(key, value)\n output = {}\n for key, value in list(new.items()):\n if value not in list(d.values()):\n output[key] = value\n inverse = {a: b for b, a in list(output.items())}\n return inverse","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":5650,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-03-07 17:25:58","func_code":"def swap_unique_keys_values(d):\n swp_d = {}\n nums = []\n final_nums = []\n dic = {}\n for lines in d:\n nums.append(str(d[lines]))\n swp_d[d[lines]] = lines\n for lines in nums:\n if nums.count(lines) == 1:\n final_nums.append(int(lines))\n for words in final_nums:\n dic[words] = swp_d[words]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":26672,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-03-07 17:25:58","func_code":"def swap_unique_keys_values(d):\n swp_d = {}\n nums = []\n final_nums = []\n dic = {}\n for lines in d:\n nums.append(str(d[lines]))\n swp_d[d[lines]] = lines\n for lines in nums:\n if nums.count(lines) == 1:\n final_nums.append(int(lines))\n for words in final_nums:\n dic[words] = swp_d[words]\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":34366,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-07 17:26:30","func_code":"def swap_keys_values():\n oldkeys = []\n oldvalues = []\n swappeddict = {}\n for key in dictionary:\n oldkeys.append(list(dictionary.keys()))\n oldvalues.append(list(dictionary.values()))\n for e in oldkeys:\n swappeddict[oldvlaues] = oldkeys\n return swappeddict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":10474,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-07 17:26:56","func_code":"def swap_keys_values(dictionary):\n oldkeys = []\n oldvalues = []\n swappeddict = {}\n for key in dictionary:\n oldkeys.append(list(dictionary.keys()))\n oldvalues.append(list(dictionary.values()))\n for e in oldkeys:\n swappeddict[oldvlaues] = oldkeys\n return swappeddict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":38765,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-07 17:27:18","func_code":"def swap_keys_values(dictionary):\n oldkeys = []\n oldvalues = []\n swappeddict = {}\n for key in dictionary:\n oldkeys.append(list(dictionary.keys()))\n oldvalues.append(list(dictionary.values()))\n for e in oldkeys:\n swappeddict[oldvalues] = oldkeys\n return swappeddict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":32144,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-07 17:31:10","func_code":"def swap_keys_values(dictionary):\n oldkeys = []\n oldvalues = []\n swappeddict = {}\n for key in dictionary:\n oldkeys.append(list(dictionary.keys()))\n oldvalues.append(list(dictionary.values()))\n i = 0\n while i < len(oldkeys):\n swappeddict[oldvalues[i]] = oldkeys[i]\n i = i + 1\n return swappeddict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":38624,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-07 17:31:10","func_code":"def swap_keys_values(dictionary):\n oldkeys = []\n oldvalues = []\n swappeddict = {}\n for key in dictionary:\n oldkeys.append(list(dictionary.keys()))\n oldvalues.append(list(dictionary.values()))\n i = 0\n while i < len(oldkeys):\n swappeddict[oldvalues[i]] = oldkeys[i]\n i = i + 1\n return swappeddict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":31062,"user":"43970e5c-c052-428d-b0b5-4e1c8766b9bb","date":"2018-03-07 17:47:29","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":4437,"user":"43970e5c-c052-428d-b0b5-4e1c8766b9bb","date":"2018-03-07 17:47:29","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":19730,"user":"43970e5c-c052-428d-b0b5-4e1c8766b9bb","date":"2018-03-07 17:47:47","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if list(d.values()).count(v) == 1:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":27688,"user":"43970e5c-c052-428d-b0b5-4e1c8766b9bb","date":"2018-03-07 17:47:47","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if list(d.values()).count(v) == 1:\n new_d[v] = k\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":14130,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-03-07 19:19:36","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n if d < r1 + r2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":7589,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-03-07 19:19:36","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n if d < r1 + r2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":35863,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-03-07 19:42:18","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":18143,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-03-07 19:42:18","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39063,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-07 20:04:08","func_code":"def swap_keys_values(d):\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":25629,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-07 20:04:08","func_code":"def swap_keys_values(d):\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":29928,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-07 20:04:28","func_code":"def swap_unique_keys_values(d):\n d = dict(set(d))\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":24116,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-07 20:04:28","func_code":"def swap_unique_keys_values(d):\n d = dict(set(d))\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30262,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-07 20:04:28","func_code":"def swap_unique_keys_values(d):\n d = dict(set(d))\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":17027,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-03-07 23:21:31","func_code":"def swap_keys_values(d):\n return {d[key]: key for key in d}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":13861,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-03-07 23:21:31","func_code":"def swap_keys_values(d):\n return {d[key]: key for key in d}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":12877,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-03-07 23:28:06","func_code":"def swap_unique_keys_values(d):\n return dict([(v, k) for k, v in list(d.items()) if list(d.values()).\n count(v) == 1])","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":23335,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-03-07 23:28:06","func_code":"def swap_unique_keys_values(d):\n return dict([(v, k) for k, v in list(d.items()) if list(d.values()).\n count(v) == 1])","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":8005,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-03-08 10:22:13","func_code":"def swap_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append(file)\n for letter in a:\n c[dic[letter]] = letter\n return c","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":41894,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-03-08 10:22:13","func_code":"def swap_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append(file)\n for letter in a:\n c[dic[letter]] = letter\n return c","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":40242,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-03-08 10:22:33","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append([file, dic[file]])\n for letter in a:\n if letter[1] in c:\n del c[letter[1]]\n else:\n c[letter[1]] = letter[0]\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":21201,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-03-08 10:22:33","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append([file, dic[file]])\n for letter in a:\n if letter[1] in c:\n del c[letter[1]]\n else:\n c[letter[1]] = letter[0]\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":8987,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-03-08 10:22:33","func_code":"def swap_unique_keys_values(dic):\n a, b, c = [], [], {}\n for file in dic:\n a.append([file, dic[file]])\n for letter in a:\n if letter[1] in c:\n del c[letter[1]]\n else:\n c[letter[1]] = letter[0]\n return c","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":5633,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:18:36","func_code":"def swap_keys_values(s):\n dictionary = {}\n for i in s:\n dictionary[s[i]] = i\n return d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":10312,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:18:51","func_code":"def swap_keys_values(s):\n dictionary = {}\n for i in s:\n dictionary[s[i]] = i\n return dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":7311,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:21:33","func_code":"def swap_keys_values(d):\n dictionary = {}\n for key in d:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":9683,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:21:43","func_code":"def swap_keys_values(d):\n dictionary = {}\n for key in d:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":29844,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:21:43","func_code":"def swap_keys_values(d):\n dictionary = {}\n for key in d:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":38537,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:44:33","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(key)\n dictionary[d[unique]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":25866,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:45:10","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(key)\n dictionary[d[unique[key]]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":23751,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:47:11","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(d[key])\n dictionary[d[unique]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":3400,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:48:21","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(d[key])\n for i in unique:\n dictionary[unique[i]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":943,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:49:14","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(d[key])\n for i in unique:\n dictionary[d[i]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6438,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-03-08 12:51:59","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":3238,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-03-08 12:51:59","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18438,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-03-08 12:52:06","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in new_d:\n new_d[v] = k\n else:\n del new_d[v]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":32060,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-03-08 12:52:06","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in new_d:\n new_d[v] = k\n else:\n del new_d[v]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":29087,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:55:39","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(d[key])\n for i in unique:\n dictionary[i] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":19054,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:56:38","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(key)\n for i in unique:\n dictionary[i] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":19789,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 12:57:22","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(d[key])\n for i in unique:\n dictionary[i[unique]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":4825,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:00:21","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(d[key])\n for i in unique:\n dictionary[unique[i]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":15558,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:00:36","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(d[key])\n for i in unique:\n dictionary[unique[0]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":41323,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:01:13","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if d[key] in unique:\n unique.append(d[key])\n for i in unique:\n dictionary[unique[0]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18007,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:01:27","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(d[key])\n for i in unique:\n dictionary[unique[1]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":14508,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:01:44","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(d[key])\n for i in unique:\n dictionary[i[0]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":27763,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 13:02:15","func_code":"def swap_unique_keys_values(d):\n d = set(d)\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":24922,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 13:02:36","func_code":"def swap_unique_keys_values(d):\n d = set(d)\n inv = {v: k for k, v in d}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":22528,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:05:05","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not d[key] in unique:\n unique.append(d[key])\n for keys in d:\n if keys in unique:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":13249,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:05:40","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n for keys in d:\n if keys in unique:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":31710,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:05:54","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if d[key] in unique:\n unique.append(d[key])\n for keys in d:\n if keys in unique:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":37268,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:06:46","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n for keys in d:\n if keys in unique:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":16969,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 13:07:02","func_code":"def swap_unique_keys_values(d):\n d = list(set(d))\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":21516,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:07:09","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if key not in unique:\n unique.append(d[key])\n for keys in d:\n if keys in unique:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":7426,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:07:36","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n for keys in d:\n if keys[0] in unique:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35427,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 13:07:42","func_code":"def swap_unique_keys_values(d):\n d = list(set(d))\n inv = {v: k for k, v in list(d.items())}\n return d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":31406,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:07:49","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n for keys in d:\n if keys[1] in unique:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":7352,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 13:08:03","func_code":"def swap_unique_keys_values(d):\n d = list(set(d))\n return d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":36890,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:09:14","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n for keys in unique:\n if keys in unique:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":20277,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:10:59","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n for keys in unique:\n dictionary[d[keys]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":27937,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:11:22","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n for keys in unique:\n dictionary[d[key]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":10609,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 13:12:25","func_code":"def swap_unique_keys_values(d):\n d = list(set(d))\n d = {k: v for k, v in d}\n inv = {v: k for k, v in list(d.items())}\n return d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":9636,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 13:13:51","func_code":"def swap_unique_keys_values(d):\n d = set(d)\n d = {k: v for k, v in d}\n inv = {v: k for k, v in list(d.items())}\n return d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29470,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 13:27:14","func_code":"def swap_unique_keys_values(d):\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":1143,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 13:57:31","func_code":"def swap_unique_keys_values(d):\n inv = {v: k for k, v in list(d.items())}\n d = []\n for k in list(inv.keys()):\n d.append(k)\n for k in d:\n if d.count(k) > 1:\n del inv[k]\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":33485,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-03-08 13:58:21","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":19205,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-03-08 13:58:21","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":27628,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:59:30","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n for key in unique:\n dictionary[d[key]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":24937,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:59:42","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n for key in unique:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":19560,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 13:59:54","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n for keys in unique:\n dictionary[d[key]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":10294,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:00:09","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n for keys in unique:\n dictionary[d[key]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":41012,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:01:18","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if not key in unique:\n unique.append(key)\n for keys in unique:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":38069,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-03-08 14:02:03","func_code":"def point_distance(x1, y1, x2, y2):\n return ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return point_distance(x1, y1, x2, y2) < r1 + r2\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return point_distance(x1, y1, x2, y2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":13657,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 14:02:48","func_code":"def swap_unique_keys_values(d):\n inv = {v: k for k, v in list(d.items())}\n d = []\n for k in list(inv.keys()):\n d.append(k)\n for k in d:\n if d.count(k) > 1:\n del inv[k]\n del inv[k]\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":13427,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:02:49","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n for key in d:\n if key in unique:\n unique.append(key)\n for keys in unique:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":29952,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:11:46","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n not_unique = []\n for key in d:\n if not key in unique:\n unique.append(key)\n else:\n not unique.append(key)\n for keys in unique:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":35984,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:12:31","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n not_unique = []\n for key in d:\n if not key in unique:\n unique.append(key)\n else:\n not unique.append(key)\n for keys in unique:\n if not keys in unique:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30763,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:13:40","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n not_unique = []\n for key in d:\n if not key in unique:\n unique.append(key)\n else:\n not unique.append(key)\n for keys in unique:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":23744,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 14:13:50","func_code":"def swap_unique_keys_values(d):\n inv = {v: k for k, v in list(d.items())}\n for k in list(inv.keys()):\n if list(inv.keys()).count(inv[k]) > 1:\n del inv[k]\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":10610,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-03-08 14:17:51","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":15321,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-03-08 14:18:47","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":38148,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:18:48","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n not_unique = []\n value = []\n for key in d:\n if not key in unique:\n unique.append(key)\n else:\n not_unique.append(key)\n for i in unique:\n if not not_unique in unique:\n value.append(i)\n for keys in value:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":22345,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:20:49","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n not_unique = []\n value = []\n for key in d:\n if not key in unique:\n unique.append(d[key])\n else:\n not_unique.append(d[key])\n for i in unique:\n if not not_unique in unique:\n value.append(i)\n for keys in value:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":26405,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:21:12","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n not_unique = []\n value = []\n for key in d:\n if not key in unique:\n unique.append(key)\n else:\n not_unique.append(key)\n for i in unique:\n if not_unique in unique:\n value.append(i)\n for keys in value:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":33805,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 14:22:30","func_code":"def swap_unique_keys_values(d):\n for k in list(inv.keys()):\n if list(d.values()).count(d[k]) > 1:\n del d[k]\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":31114,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 14:22:53","func_code":"def swap_unique_keys_values(d):\n for k in list(d.keys()):\n if list(d.values()).count(d[k]) > 1:\n del d[k]\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":12492,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 14:22:53","func_code":"def swap_unique_keys_values(d):\n for k in list(d.keys()):\n if list(d.values()).count(d[k]) > 1:\n del d[k]\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":18924,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-08 14:22:53","func_code":"def swap_unique_keys_values(d):\n for k in list(d.keys()):\n if list(d.values()).count(d[k]) > 1:\n del d[k]\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":6441,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-03-08 14:23:10","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3460,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-03-08 14:23:10","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":36368,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-03-08 14:23:36","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":9721,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-03-08 14:23:36","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":5962,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:24:19","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n not_unique = []\n value = []\n for key in d:\n if not key in unique:\n unique.append(key)\n else:\n not_unique.append(key)\n for i in unique:\n if not unique in not_unique:\n value.append(i)\n for keys in value:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":10994,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-03-08 14:24:27","func_code":"def append2list(l1, l2=[]):\n if len(l2) > 1:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":27508,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-03-08 14:25:07","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":2502,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-03-08 14:26:30","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 == []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":26527,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-03-08 14:26:35","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":18341,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-03-08 14:26:35","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37415,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-03-08 14:26:48","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1939,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-03-08 14:26:48","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":34895,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-03-08 14:27:06","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32630,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-03-08 14:27:06","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":2479,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-03-08 14:27:14","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":25101,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-03-08 14:27:14","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":34314,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-03-08 14:27:43","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":23942,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-03-08 14:27:43","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":11912,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-03-08 14:28:09","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":29881,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-03-08 14:28:09","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7256,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-03-08 14:28:48","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":6549,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-03-08 14:28:48","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":38264,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-03-08 14:29:29","func_code":"def append2list(l1, l2=None):\n for i in l1:\n if l2 == None:\n l2 = []\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":6153,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-03-08 14:29:29","func_code":"def append2list(l1, l2=None):\n for i in l1:\n if l2 == None:\n l2 = []\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30494,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-03-08 14:30:17","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":16758,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-03-08 14:30:17","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30997,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-03-08 14:30:37","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":35242,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-03-08 14:30:37","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":404,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-03-08 14:30:43","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32232,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-03-08 14:30:44","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":9027,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-03-08 14:30:44","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":15808,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-03-08 14:30:56","func_code":"def append2list(l1, l2=0):\n if l2 == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13742,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-03-08 14:30:56","func_code":"def append2list(l1, l2=0):\n if l2 == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":9392,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-03-08 14:31:00","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for word in l1:\n l2.append(word)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13687,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-03-08 14:31:00","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for word in l1:\n l2.append(word)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30055,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-03-08 14:31:54","func_code":"def append2list(l1, l2=[]):\n if not l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":19324,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-03-08 14:32:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19751,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-03-08 14:32:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":1699,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-03-08 14:32:06","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30185,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-03-08 14:32:06","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":11233,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:32:34","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n not_unique = []\n value = []\n for key in d:\n if not key in unique:\n unique.append(key)\n else:\n not_unique.append(key)\n for i in unique:\n if not not_unique in unique:\n value.append(i)\n for keys in value:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":4522,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-03-08 14:33:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":28456,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-03-08 14:33:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30899,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-03-08 14:33:22","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":4715,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-03-08 14:33:43","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":11579,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-03-08 14:33:43","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":16148,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-03-08 14:34:45","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8907,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-08 14:34:55","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1762,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-08 14:35:49","func_code":"def append2list(l1, l2=[]):\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":36892,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-03-08 14:36:03","func_code":"def overlap(x1=0, y1=1, r1=0, x2=0, y2=0, r2=0):\n distance = maths.sqrt(x2 - x1 ^ 2 + (y2 - y1) ^ 2)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":16017,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-03-08 14:36:04","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5 == r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":5825,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-03-08 14:36:11","func_code":"def append2list(l1, s=''):\n l2 = []\n for i in l1:\n l2.append(i)\n if s:\n l2.append(s)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":11112,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-08 14:36:41","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":33940,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-08 14:36:41","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3990,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-03-08 14:36:43","func_code":"def append2list(l1, s=None):\n l2 = []\n for i in l1:\n l2.append(i)\n if s:\n l2.append(s)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":38479,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-03-08 14:36:49","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 + r2) ** 2 > (x2 - x1) ** 2 + (y2 - y1) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":28169,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-03-08 14:36:51","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":5686,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:36:57","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n not_unique = []\n value = []\n for key in d:\n if not key in unique:\n unique.append(key)\n else:\n not_unique.append(key)\n for i in unique:\n unique.pop(not_unique)\n for keys in value:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":5287,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-03-08 14:37:06","func_code":"_A = None\n\n\ndef overlap(x1=_A, y1=_A, r1=_A, x2=_A, y2=_A, r2=_A):\n if x1 == _A:\n x1 = 0\n if y1 == _A:\n y1 = 0\n if r1 == _A:\n r1 = 1\n if x2 == _A:\n x2 = 0\n if y2 == _A:\n y2 = 0\n if r2 == _A:\n r2 = 1\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":10140,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-03-08 14:37:06","func_code":"_A = None\n\n\ndef overlap(x1=_A, y1=_A, r1=_A, x2=_A, y2=_A, r2=_A):\n if x1 == _A:\n x1 = 0\n if y1 == _A:\n y1 = 0\n if r1 == _A:\n r1 = 1\n if x2 == _A:\n x2 = 0\n if y2 == _A:\n y2 = 0\n if r2 == _A:\n r2 = 1\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":26410,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-03-08 14:37:13","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 + r2) ** 2 > (x2 - x1) ** 2 + (y2 - y1) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":36243,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-03-08 14:37:13","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 + r2) ** 2 > (x2 - x1) ** 2 + (y2 - y1) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":13149,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-03-08 14:37:22","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 + r2) ** 2 > (x2 - x1) ** 2 + (y2 - y1) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":138,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-03-08 14:37:22","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 + r2) ** 2 > (x2 - x1) ** 2 + (y2 - y1) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":32798,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:37:50","func_code":"def swap_unique_keys_values(d):\n dictionary = {}\n unique = []\n not_unique = []\n value = []\n for key in d:\n if not key in unique:\n unique.append(key)\n else:\n not_unique.append(key)\n for i in unique:\n unique.pop(i)\n for keys in value:\n dictionary[d[keys]] = keys\n return dictionary","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":4932,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-03-08 14:38:14","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n print((x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":35979,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-03-08 14:38:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 + r2) ** 2 > (x2 - x1) ** 2 + (y2 - y1) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":7514,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-03-08 14:38:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 + r2) ** 2 > (x2 - x1) ** 2 + (y2 - y1) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":17368,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-03-08 14:38:27","func_code":"def overlap(x1=0, y1=1, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt(x2 - x1 ^ 2 + (y2 - y1) ^ 2)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4205,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-03-08 14:38:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 == r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34478,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-03-08 14:38:42","func_code":"def append2list(l1, l2=None):\n for i in l1:\n if not l2:\n l2 = []\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3168,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-03-08 14:38:42","func_code":"def append2list(l1, l2=None):\n for i in l1:\n if not l2:\n l2 = []\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30379,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-03-08 14:38:48","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** float(0.5) == r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":30311,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-03-08 14:38:59","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":11891,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-03-08 14:38:59","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":19852,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-08 14:39:12","func_code":"def append2list(l1, l2=None):\n for i in l1:\n if not l2:\n l2 = []\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":29436,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-08 14:39:12","func_code":"def append2list(l1, l2=None):\n for i in l1:\n if not l2:\n l2 = []\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":11868,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-03-08 14:39:29","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** float(0.5) >= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34774,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-03-08 14:39:39","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** float(0.5) <= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":22101,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-03-08 14:39:43","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37238,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-03-08 14:39:43","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":26863,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-03-08 14:39:47","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** float(0.5) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":16344,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-03-08 14:39:47","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** float(0.5) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":25002,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-03-08 14:40:16","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":9599,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-03-08 14:40:16","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":33340,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-03-08 14:40:28","func_code":"def overlap(x1=0, y1=1, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":32301,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-03-08 14:40:28","func_code":"def overlap(x1=0, y1=1, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40114,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-03-08 14:40:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":5375,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-03-08 14:40:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":29335,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-03-08 14:40:46","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":32781,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-03-08 14:41:02","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 + r2) ** 2 > (x2 - x1) ** 2 + (y2 - y1) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":6453,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-03-08 14:41:02","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 + r2) ** 2 > (x2 - x1) ** 2 + (y2 - y1) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19994,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-03-08 14:41:09","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n from math import sqrt\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance >= r1 + r2:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":1505,"user":"334b0f61-5fa3-43cf-8691-29f975dd7270","date":"2018-03-08 14:41:09","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n from math import sqrt\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance >= r1 + r2:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":13819,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-03-08 14:41:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39338,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-03-08 14:41:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":23926,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-03-08 14:41:30","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":31333,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-03-08 14:41:30","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":10599,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-08 14:41:42","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32280,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-08 14:41:42","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":29906,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-03-08 14:41:59","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 > (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3486,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-03-08 14:42:12","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":29825,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-03-08 14:42:12","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":22061,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-03-08 14:42:29","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 + x1) ** 2 + (y2 + y1) ** 2)\n if distance <= radiuses:\n print(True)\n else:\n print(False)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34300,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-03-08 14:42:32","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":16902,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-03-08 14:43:23","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":23875,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-03-08 14:43:23","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":36085,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-03-08 14:43:39","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18056,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-03-08 14:43:39","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41668,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-03-08 14:44:04","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34672,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-03-08 14:44:04","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26176,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-03-08 14:44:04","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40015,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-08 14:44:09","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7592,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-08 14:44:43","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":29970,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 14:44:51","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":25185,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 14:44:51","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":5023,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-08 14:44:52","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 >= (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14220,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-08 14:45:04","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":12515,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-03-08 14:45:15","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":12486,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-03-08 14:45:15","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":15406,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-03-08 14:45:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n print(dis)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":35434,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-03-08 14:45:23","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n A = 'True'\n r = x2 - x1\n f = y2 - y1\n rf = (r ** 2 + f ** 2) ** 0.5\n if r == 0 and f == 0:\n return A\n elif r1 + r2 > rf:\n return A\n else:\n return 'False'","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18330,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-03-08 14:45:23","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n A = 'True'\n r = x2 - x1\n f = y2 - y1\n rf = (r ** 2 + f ** 2) ** 0.5\n if r == 0 and f == 0:\n return A\n elif r1 + r2 > rf:\n return A\n else:\n return 'False'","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27249,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-03-08 14:45:28","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":2818,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-03-08 14:45:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n print(dis)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":1077,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-03-08 14:45:39","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":35548,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-03-08 14:45:39","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4139,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-08 14:46:14","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":38212,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-03-08 14:46:14","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39301,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-03-08 14:46:25","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if dis <= r1 + r2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":7053,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-03-08 14:46:42","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21274,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-03-08 14:46:42","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":27196,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-03-08 14:46:44","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n l2.append(l1)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":1846,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-03-08 14:46:55","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return r1 + r2 < ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** (1 \/ 2)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":5341,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-03-08 14:47:00","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32371,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-03-08 14:47:00","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":5560,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-03-08 14:47:35","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return r1 + r2 > ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** (1 \/ 2)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":30733,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-03-08 14:47:35","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return r1 + r2 > ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** (1 \/ 2)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":27801,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-08 14:47:36","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return r1 + r2 > (x2 - x1) ** 2 + ((y2 - y1) ** 2) ** (1 \/ 2)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18479,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-08 14:47:45","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 >= (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40660,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-08 14:47:48","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":33894,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-08 14:47:48","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32264,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-03-08 14:48:08","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if dis < r1 + r2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14036,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-03-08 14:48:08","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if dis < r1 + r2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":33201,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-03-08 14:48:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":10241,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-03-08 14:48:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":22436,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-03-08 14:48:17","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8588,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-03-08 14:48:17","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":40943,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-08 14:48:18","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return r1 + r2 > ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** (1 \/ 2)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":33251,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-03-08 14:48:18","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return r1 + r2 > ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** (1 \/ 2)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":4638,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-08 14:48:21","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 <= (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34928,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-03-08 14:49:04","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":23986,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-03-08 14:49:04","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":10633,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-03-08 14:49:11","func_code":"def append2list(l1, l2=[]):\n if len(l2) == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":24223,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-03-08 14:49:16","func_code":"def fixer(l2):\n if l2 == None:\n return []\n else:\n return l2\n\n\ndef append2list(l1, l2=None):\n l2 = fixer(l2)\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1210,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-03-08 14:49:16","func_code":"def fixer(l2):\n if l2 == None:\n return []\n else:\n return l2\n\n\ndef append2list(l1, l2=None):\n l2 = fixer(l2)\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32491,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-08 14:49:43","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":15859,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-08 14:49:54","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 <= (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":21233,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-03-08 14:49:55","func_code":"def append2list(l1, l2=[]):\n if len(l2) == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":26366,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-03-08 14:49:55","func_code":"def append2list(l1, l2=[]):\n if len(l2) == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37318,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-03-08 14:50:23","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":28375,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-03-08 14:50:23","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":20308,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-03-08 14:51:18","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n c1c2 = sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\n if c1c2 < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":10416,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-03-08 14:52:29","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14732,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-03-08 14:52:29","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":20584,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 14:52:47","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 > r2) > x2 - x1 + (y2 - y1):\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":25967,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-03-08 14:52:48","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":20710,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-03-08 14:52:48","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":25633,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:52:59","func_code":"def swap_unique_keys_values(d):\n dic = {}\n values = []\n notunique = []\n for key in d:\n if d[key] in values:\n notunique.append(d[key])\n else:\n values.append(d[key])\n for key in d:\n if not d[key] in notunique:\n dic[d[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":1497,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-08 14:52:59","func_code":"def swap_unique_keys_values(d):\n dic = {}\n values = []\n notunique = []\n for key in d:\n if d[key] in values:\n notunique.append(d[key])\n else:\n values.append(d[key])\n for key in d:\n if not d[key] in notunique:\n dic[d[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":24948,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 14:53:09","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 > r2) > x2 - x1 + (y2 - y1):\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":20739,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-03-08 14:53:14","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":10493,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-03-08 14:53:22","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":6722,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-03-08 14:53:22","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":41950,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 14:53:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 > r2) >= x2 - x1 + (y2 - y1):\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":7647,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 14:53:55","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if r1 + r2 > x2 - x1 + (y2 - y1):\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41882,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-08 14:54:10","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":23837,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-08 14:55:28","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/\/ 2\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":36727,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-08 14:55:34","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":31116,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-08 14:55:34","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":38482,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-08 14:55:34","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1259,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-08 14:55:45","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/\/ 2\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27242,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-03-08 14:56:05","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":19336,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-03-08 14:56:05","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8050,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 14:56:22","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if r1 \/\/ 2 + r2 \/\/ 2 > (x2 - x1)(x2 - x1) \/\/ 2 + (y2 - y1)(y2 - y1) \/\/ 2:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34930,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-03-08 14:56:48","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":20120,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-03-08 14:57:25","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":35058,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-08 14:57:44","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/\/ 2\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":11139,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-03-08 14:58:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n boolean_intersects = math.hypot(x2 - x1, y2 - y1) < r1 + r2\n return boolean_intersects","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18667,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-03-08 14:58:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n boolean_intersects = math.hypot(x2 - x1, y2 - y1) < r1 + r2\n return boolean_intersects","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":9139,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-03-08 14:58:24","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4909,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-03-08 14:58:24","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":36786,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 14:58:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x2 - x1)(x2 - x1) \/\/ 2 + (y2 - y1)(y2 - y1) \/\/ 2 < (r1 + r2)(r1 + r2):\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":24096,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-03-08 14:59:25","func_code":"def dist(x1, y1, x2, y2):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n\n\ndef overlap(x1, y1, r1, x2, y2, r2):\n return dist(x1, y1, x2, y2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":10919,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-03-08 14:59:36","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3704,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-03-08 14:59:36","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21774,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-08 14:59:38","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n intersect = math.hypot(x1 - x2, y1 - y2) < r1 + r2\n return intersect","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39769,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-03-08 14:59:38","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n intersect = math.hypot(x1 - x2, y1 - y2) < r1 + r2\n return intersect","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":36543,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 14:59:42","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2)(r1 + r2):\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18440,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2018-03-08 14:59:42","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39396,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2018-03-08 14:59:42","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":17075,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-03-08 14:59:45","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":25443,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-03-08 14:59:45","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":28075,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 15:00:07","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4369,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-03-08 15:00:09","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":10557,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-03-08 15:00:09","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":31643,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-03-08 15:00:10","func_code":"def dist(x1, y1, x2, y2):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n\n\ndef overlap(x1, y1, r1, x2, y2, r2):\n return dist(x1, y1, x2, y2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":19461,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 15:00:22","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 > (r1 + r2) ** 2:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":33844,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-08 15:00:30","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 - r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":16762,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 15:00:37","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 >= (r1 + r2) ** 2:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":12732,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-08 15:00:37","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 >= (r1 + r2) ** 2:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":31762,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-08 15:00:49","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 > (r1 - r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34240,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-08 15:01:00","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7785,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-08 15:01:00","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":25040,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-08 15:01:00","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":36994,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-08 15:01:13","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 > (r1 - r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":13727,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-08 15:01:29","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1432,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-08 15:01:29","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21988,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-08 15:01:36","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 - r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4699,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-03-08 15:02:02","func_code":"def dist(x1, y1, x2, y2):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=0):\n return dist(x1, y1, x2, y2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":32954,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-03-08 15:02:02","func_code":"def dist(x1, y1, x2, y2):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=0):\n return dist(x1, y1, x2, y2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":40655,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-03-08 15:02:30","func_code":"def append2list(l1, l2=[]):\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":7467,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-03-08 15:02:43","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":6315,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-03-08 15:02:43","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":25244,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-03-08 15:02:47","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2\n l2 = []","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":31811,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-03-08 15:02:52","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 - r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41537,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-08 15:03:01","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/\/ 2\n return distance <= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":28336,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-03-08 15:03:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n h = y2 - y1\n b = x2 - x1\n hyp = h ** 2 + b ** 2\n return not (r1 + r2) ** 2 <= hyp","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":38085,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-03-08 15:03:50","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":20075,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-08 15:03:50","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4901,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-03-08 15:03:50","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":16310,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-03-08 15:03:50","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":12612,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-03-08 15:03:56","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n if int(distance) < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":35936,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-03-08 15:03:56","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n if int(distance) < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":42221,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-08 15:04:18","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if x1 + y1 + x2 + y2 + r1 + r2 == 0:\n return True\n else:\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":12023,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-08 15:04:18","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if x1 + y1 + x2 + y2 + r1 + r2 == 0:\n return True\n else:\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18053,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-08 15:04:33","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/\/ 2\n return distance <= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":8037,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-08 15:04:33","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/\/ 2\n return distance <= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":22708,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-03-08 15:05:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n h = y2 - y1\n b = x2 - x1\n hyp = h ** 2 + (b ** 2) ** (1 \/ 2)\n return not r1 + r2 <= hyp","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":15744,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-03-08 15:05:48","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n h = y2 - y1\n b = x2 - x1\n hyp = int(h ** 2 + (b ** 2) ** (1 \/ 2))\n return not r1 + r2 <= hyp","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":22095,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-03-08 15:06:18","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n h = y2 - y1\n b = x2 - x1\n hyp = h ** 2 + b ** 2\n return not (r1 + r2) ** 2 <= hyp","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":2085,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-03-08 15:06:18","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n h = y2 - y1\n b = x2 - x1\n hyp = h ** 2 + b ** 2\n return not (r1 + r2) ** 2 <= hyp","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":28365,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-03-08 15:07:37","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":40501,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-03-08 15:07:37","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32443,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-03-08 15:07:50","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":16298,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-03-08 15:07:50","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":12716,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-03-08 15:07:53","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n radius = r1 + r2\n return radius < distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19295,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-03-08 15:07:58","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n radius = r1 + r2\n return distance < radius","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":39053,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-03-08 15:07:58","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n radius = r1 + r2\n return distance < radius","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":15344,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-03-08 15:08:32","func_code":"def append2list(l1, l2=[]):\n if l2 is none:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":27455,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-03-08 15:09:05","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n radius = r1 + r2\n return radius < distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41207,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-03-08 15:09:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32610,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-03-08 15:09:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7148,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-03-08 15:09:34","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n radius = r1 + r2\n return radius < distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":17107,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-03-08 15:10:02","func_code":"def overlap(xo=0, yo=0, ro=1, xt=0, yt=0, rt=1):\n run = int(xo) - int(xt)\n print(run)\n rise = int(yo) - int(yt)\n print(rise)\n distance = (run ** 2 + rise ** 2) ** 0.5\n print(distance)\n return distance < ro + rt","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":7859,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-03-08 15:10:21","func_code":"def overlap(xo=0, yo=0, ro=1, xt=0, yt=0, rt=1):\n run = int(xo) - int(xt)\n rise = int(yo) - int(yt)\n distance = (run ** 2 + rise ** 2) ** 0.5\n return distance < ro + rt","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":6133,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-03-08 15:11:28","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n radius = r1 + r2\n return radius > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":31226,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-03-08 15:11:28","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n radius = r1 + r2\n return radius > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":32316,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2018-03-08 15:13:21","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((int(x2) - int(x1)) ** 2 + (int(y2) - int(y1)) ** 2) ** -1 < int(r1\n ) + int(r2)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":8860,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-03-08 15:13:54","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":4408,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-03-08 15:13:54","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21675,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-03-08 15:15:57","func_code":"def overlap(xo=0, yo=0, ro=1, xt=0, yt=0, rt=1):\n run = int(xt) - int(xo)\n rise = int(yt) - int(yo)\n distance = (run ** 2 + rise ** 2) ** 0.5\n return distance < ro + rt","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":23191,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-03-08 15:16:31","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":42432,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-03-08 15:16:31","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":23163,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-03-08 15:16:56","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":17127,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-03-08 15:16:56","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19345,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2018-03-08 15:17:03","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n try:\n return ((int(x2) - int(x1)) ** 2 + (int(y2) - int(y1)) ** 2\n ) ** -1 < int(r1) + int(r2)\n except ZeroDivisionError:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":7597,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-03-08 15:17:12","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n run = int(x1) - int(x2)\n rise = int(y1) - int(y2)\n distance = (run ** 2 + rise ** 2) ** 0.5\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":34962,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-03-08 15:17:12","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n run = int(x1) - int(x2)\n rise = int(y1) - int(y2)\n distance = (run ** 2 + rise ** 2) ** 0.5\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":39326,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-03-08 15:19:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":17909,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-03-08 15:19:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":13029,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-03-08 15:21:01","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":2939,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-03-08 15:21:01","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":15403,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-03-08 15:21:46","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":9710,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-03-08 15:21:46","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":33658,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2018-03-08 15:24:02","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (int(x2) - int(x1)) ** 2 + (int(y2) - int(y1)) ** 2 != 0:\n return ((int(x2) - int(x1)) ** 2 + (int(y2) - int(y1)) ** 2\n ) ** -1 < int(r1) + int(r2)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39124,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-03-08 15:25:37","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":15455,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-03-08 15:25:37","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":10963,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-03-08 15:25:37","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":5841,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2018-03-08 15:25:50","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n try:\n return ((int(x2) - int(x1)) ** 2 + (int(y2) - int(y1)) ** 2\n ) ** -1 < int(r1) + int(r2)\n except ZeroDivisionError:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34991,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2018-03-08 15:27:12","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n try:\n return ((int(x2) - int(x1)) ** 2 + (int(y2) - int(y1)) ** 2\n ) ** -1 > int(r1) + int(r2)\n except ZeroDivisionError:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":29985,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2018-03-08 15:27:53","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n try:\n return ((int(x2) - int(x1)) ** 2 + (int(y2) - int(y1)) ** 2) ** -1\n except ZeroDivisionError:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3941,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2018-03-08 15:30:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n try:\n return ((int(x2) - int(x1)) ** 2 + (int(y2) - int(y1)) ** 2) ** (1 \/ 2\n ) < int(r1) + int(r2)\n except ZeroDivisionError:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":33740,"user":"3299788f-7847-4a87-af83-a4ce95b853ee","date":"2018-03-08 15:30:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n try:\n return ((int(x2) - int(x1)) ** 2 + (int(y2) - int(y1)) ** 2) ** (1 \/ 2\n ) < int(r1) + int(r2)\n except ZeroDivisionError:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":12287,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-03-08 15:35:24","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n print(True)\n else:\n print(False)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":8095,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-03-08 15:39:16","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":33426,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-03-08 15:39:16","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":35864,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-03-08 15:39:22","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n print(True)\n else:\n print(False)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":16973,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-03-08 15:39:22","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n print(True)\n else:\n print(False)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":775,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2018-03-08 15:46:09","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37661,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2018-03-08 15:46:09","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":26219,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2018-03-08 15:51:50","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26530,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2018-03-08 15:53:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":21139,"user":"b67cd859-9a7c-482d-b980-f147ea336355","date":"2018-03-08 15:53:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":32952,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-03-08 16:11:24","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":13838,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-03-08 16:11:24","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":20761,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-03-08 16:26:40","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n new_dict = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n new_dict[values[i]] = keys[i]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":21692,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-03-08 16:26:40","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n new_dict = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n new_dict[values[i]] = keys[i]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":30912,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-03-08 16:26:40","func_code":"def swap_unique_keys_values(d):\n keys = list(d.keys())\n values = list(d.values())\n new_dict = {}\n for i in range(len(keys)):\n if values.count(values[i]) == 1:\n new_dict[values[i]] = keys[i]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35638,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-03-08 17:01:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":18923,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-03-08 17:01:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37240,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-03-08 17:01:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":6246,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-03-08 17:16:21","func_code":"def append2list(l1, l2=None):\n if l2 in None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":23809,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-03-08 17:17:19","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21571,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-03-08 17:17:19","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21552,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-03-08 17:28:18","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2\n return dist","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":8449,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-03-08 17:30:21","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2\n return dist","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":3373,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-03-08 17:30:21","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2\n return dist","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":33825,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-03-08 17:32:23","func_code":"def append2list(l1, l2=None):\n if not l2:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30469,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-03-08 17:32:23","func_code":"def append2list(l1, l2=None):\n if not l2:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8673,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-03-08 17:35:14","func_code":"def append2list(l1, l2):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":33012,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-03-08 17:35:14","func_code":"def append2list(l1, l2):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21577,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-03-08 17:35:14","func_code":"def append2list(l1, l2):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1819,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-03-08 17:39:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance_between_centers = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n sum_of_radii = r2 + r1\n if sum_of_radii > distance_between_centers:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":23039,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-03-08 17:54:00","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance_between_centers = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n sum_of_radii = r2 + r1\n if sum_of_radii > distance_between_centers:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":12109,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-03-08 17:54:00","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance_between_centers = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n sum_of_radii = r2 + r1\n if sum_of_radii > distance_between_centers:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":37321,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-03-08 21:17:14","func_code":"def dist2(x1, y1, x2, y2):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return dist2(x1, y1, x2, y2) < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27147,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-03-08 21:17:14","func_code":"def dist2(x1, y1, x2, y2):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return dist2(x1, y1, x2, y2) < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40657,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-03-08 21:17:15","func_code":"def append2list(l1, l2=None):\n if not l2:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30829,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-03-08 21:17:15","func_code":"def append2list(l1, l2=None):\n if not l2:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":34853,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-03-08 21:53:29","func_code":"def point_distance(x1, y1, x2, y2):\n return ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return point_distance(x1, y1, x2, y2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":5397,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-03-08 22:00:50","func_code":"def point_distance(x1, y1, x2, y2):\n return ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return point_distance(x1, y1, x2, y2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":42150,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-03-08 22:00:50","func_code":"def point_distance(x1, y1, x2, y2):\n return ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return point_distance(x1, y1, x2, y2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":5369,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-03-08 22:00:50","func_code":"def point_distance(x1, y1, x2, y2):\n return ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return point_distance(x1, y1, x2, y2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":27173,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-03-08 22:57:00","func_code":"def swap_keys_values(d):\n new_dic = {}\n for k, v in list(d.items()):\n new_dic[v] = k\n return new_dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":2988,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-03-08 22:57:00","func_code":"def swap_keys_values(d):\n new_dic = {}\n for k, v in list(d.items()):\n new_dic[v] = k\n return new_dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":37617,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-03-08 23:04:17","func_code":"def swap_unique_keys_values(d):\n new_dic = {}\n for k, v in list(d.items()):\n if d[k] not in new_dic:\n new_dic[v] = k\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":22625,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-03-08 23:20:58","func_code":"def swap_unique_keys_values(d):\n new_dic = {}\n keys2swap = [d[key] for key in d]\n for k, v in list(d.items()):\n if keys2swap.count(v) == 1:\n new_dic[v] = k\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":32319,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-03-08 23:20:58","func_code":"def swap_unique_keys_values(d):\n new_dic = {}\n keys2swap = [d[key] for key in d]\n for k, v in list(d.items()):\n if keys2swap.count(v) == 1:\n new_dic[v] = k\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":12753,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-03-08 23:20:58","func_code":"def swap_unique_keys_values(d):\n new_dic = {}\n keys2swap = [d[key] for key in d]\n for k, v in list(d.items()):\n if keys2swap.count(v) == 1:\n new_dic[v] = k\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":20805,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-03-09 00:28:52","func_code":"def swap_unique_keys_values():\n dic1 = {}\n dic2 = {}\n dicsort = sorted(list(d.items()), reverse=True)\n for k, v in dicsort:\n if v not in dic1:\n dic1[v] = k\n else:\n dic1[v] = 'N'\n dicsort2 = sorted(list(dic1.items()), reverse=True)\n for k, v in dicsort2:\n if v != 'N':\n dic2[k] = v\n return dic2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":39965,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-03-09 00:31:15","func_code":"def swap_unique_keys_values():\n dic1 = {}\n dic2 = {}\n dicsort = sorted(list(d.items()), reverse=True)\n for k, v in dicsort:\n if v not in dic1:\n dic1[v] = k\n else:\n dic1[v] = 'N'\n dicsort2 = sorted(list(dic1.items()), reverse=True)\n for k, v in dicsort2:\n if v != 'N':\n dic2[k] = v\n return dic2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":41960,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-03-09 00:32:58","func_code":"def swap_unique_keys_values(d):\n dic1 = {}\n dic2 = {}\n dicsort = sorted(list(d.items()), reverse=True)\n for k, v in dicsort:\n if v not in dic1:\n dic1[v] = k\n else:\n dic1[v] = 'N'\n dicsort2 = sorted(list(dic1.items()), reverse=True)\n for k, v in dicsort2:\n if v != 'N':\n dic2[k] = v\n return dic2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":26769,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-03-09 00:32:58","func_code":"def swap_unique_keys_values(d):\n dic1 = {}\n dic2 = {}\n dicsort = sorted(list(d.items()), reverse=True)\n for k, v in dicsort:\n if v not in dic1:\n dic1[v] = k\n else:\n dic1[v] = 'N'\n dicsort2 = sorted(list(dic1.items()), reverse=True)\n for k, v in dicsort2:\n if v != 'N':\n dic2[k] = v\n return dic2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":36021,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-03-09 02:47:35","func_code":"def get_distance(x1, y1, x2, y2):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return get_distance(x1, y1, x2, y2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":32341,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-03-09 02:47:35","func_code":"def get_distance(x1, y1, x2, y2):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return get_distance(x1, y1, x2, y2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":16590,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-03-09 02:47:42","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":14007,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-03-09 02:47:42","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":5660,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-09 09:50:33","func_code":"def swap_keys_values(d):\n new_dict = {v: k for k, v in list(d.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":6887,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-09 09:50:33","func_code":"def swap_keys_values(d):\n new_dict = {v: k for k, v in list(d.items())}\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21083,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-09 11:34:06","func_code":"def swap_unique_keys_values(d):\n e = {}\n h = {}\n for k, v in sorted(list(d.items()), reverse=True):\n if v in e:\n e[k] = v\n else:\n e[k] = 'n'\n for k, v in sorted(list(e.items()), reverse=True):\n if v != 'n':\n h[k] = v\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":42322,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-09 11:36:00","func_code":"def swap_unique_keys_values(d):\n e = {}\n h = {}\n for k, v in sorted(list(d.items()), reverse=True):\n if v not in e:\n e[v] = k\n else:\n e[v] = 'n'\n for k, v in sorted(list(e.items()), reverse=True):\n if v != 'n':\n h[k] = v\n return h","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":10202,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-09 11:36:00","func_code":"def swap_unique_keys_values(d):\n e = {}\n h = {}\n for k, v in sorted(list(d.items()), reverse=True):\n if v not in e:\n e[v] = k\n else:\n e[v] = 'n'\n for k, v in sorted(list(e.items()), reverse=True):\n if v != 'n':\n h[k] = v\n return h","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":13343,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-09 11:55:47","func_code":"def swap_keys_values(d):\n new = {}\n for k, v in list(d.items()):\n new[v] = k\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":26910,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-09 11:55:47","func_code":"def swap_keys_values(d):\n new = {}\n for k, v in list(d.items()):\n new[v] = k\n return new","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":25724,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-09 12:41:40","func_code":"def swap_unique_keys_values(d):\n new = {}\n keys = [k for k in list(d.keys())]\n values = [v for v in list(d.values())]\n for k, v in list(d.items()):\n if values.count(v) == 1:\n new[v] = k\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":40288,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-09 12:41:40","func_code":"def swap_unique_keys_values(d):\n new = {}\n keys = [k for k in list(d.keys())]\n values = [v for v in list(d.values())]\n for k, v in list(d.items()):\n if values.count(v) == 1:\n new[v] = k\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":1355,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-09 14:44:56","func_code":"def swap_keys_values(dictionary):\n oldkeys = []\n oldvalues = []\n swappeddict = {}\n for key in list(dictionary.keys()):\n oldkeys.append(key)\n for value in list(dictionary.values()):\n oldvalues.append(value)\n i = 0\n while i < len(oldkeys):\n swappeddict[oldvalues[i]] = oldkeys[i]\n i = i + 1\n return swappeddict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":33508,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-09 14:44:56","func_code":"def swap_keys_values(dictionary):\n oldkeys = []\n oldvalues = []\n swappeddict = {}\n for key in list(dictionary.keys()):\n oldkeys.append(key)\n for value in list(dictionary.values()):\n oldvalues.append(value)\n i = 0\n while i < len(oldkeys):\n swappeddict[oldvalues[i]] = oldkeys[i]\n i = i + 1\n return swappeddict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":25569,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-03-09 14:45:19","func_code":"def swap_keys_values(d):\n dictionary = {}\n for key in d:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21735,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-03-09 14:45:19","func_code":"def swap_keys_values(d):\n dictionary = {}\n for key in d:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":37705,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-03-09 14:47:01","func_code":"def swap_unique_keys_values(d):\n dic = {}\n values = []\n notunique = []\n for key in d:\n if d[key] in values:\n notunique.append(d[key])\n else:\n values.append(d[key])\n for key in d:\n if not d[key] in notunique:\n dic[d[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":6931,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-03-09 14:47:01","func_code":"def swap_unique_keys_values(d):\n dic = {}\n values = []\n notunique = []\n for key in d:\n if d[key] in values:\n notunique.append(d[key])\n else:\n values.append(d[key])\n for key in d:\n if not d[key] in notunique:\n dic[d[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":29581,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-09 14:50:48","func_code":"def swap_unique_keys_values(dictionary):\n oldkeys = []\n oldvalues = []\n invalid = []\n swappeddict = {}\n for value in list(dictionary.values()):\n if value not in oldvalues:\n oldvalues.append(value)\n else:\n oldvalues.pop(value)\n invalid.append(value)\n for key in list(dictionary.keys()):\n if key.value() not in invalid:\n oldkeys.append(key)\n i = 0\n while i < len(oldkeys):\n swappeddict[oldvalues[i]] = oldkeys[i]\n i = i + 1\n return swappeddict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":2593,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-09 14:52:09","func_code":"def swap_unique_keys_values(dictionary):\n oldkeys = []\n oldvalues = []\n invalid = []\n swappeddict = {}\n for value in list(dictionary.values()):\n if value not in oldvalues:\n oldvalues.append(value)\n else:\n invalid.append(value)\n if value in oldvalues:\n oldvalues.pop(value)\n for key in list(dictionary.keys()):\n if key.value() not in invalid:\n oldkeys.append(key)\n i = 0\n while i < len(oldkeys):\n swappeddict[oldvalues[i]] = oldkeys[i]\n i = i + 1\n return swappeddict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":17754,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-03-09 15:02:31","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30721,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-03-09 15:02:31","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39888,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-09 15:06:34","func_code":"def swap_unique_keys_values(d):\n if list(d.values()).count(d[k]) != 1 in list(d.keys()):\n del d[k]\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":4583,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-03-09 15:08:14","func_code":"def swap_keys_values(dictionary):\n new_dictionary = {}\n for key in dictionary:\n new_dictionary[dictionary[key]] = key\n return new_dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":40051,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-03-09 15:08:14","func_code":"def swap_keys_values(dictionary):\n new_dictionary = {}\n for key in dictionary:\n new_dictionary[dictionary[key]] = key\n return new_dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":22749,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-03-09 15:08:23","func_code":"def swap_unique_keys_values(dictionary):\n values = []\n new_dict = {}\n for key in dictionary:\n values.append(dictionary[key])\n for key, value in list(dictionary.items()):\n if values.count(value) == 1:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":41954,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-03-09 15:08:23","func_code":"def swap_unique_keys_values(dictionary):\n values = []\n new_dict = {}\n for key in dictionary:\n values.append(dictionary[key])\n for key, value in list(dictionary.items()):\n if values.count(value) == 1:\n new_dict[value] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":17477,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-09 15:09:11","func_code":"def swap_unique_keys_values(d):\n for k in list(d.values()):\n if list(d.values()).count(d[k]) != 1:\n del d[k]\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":25232,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-09 15:10:01","func_code":"def swap_unique_keys_values(d):\n v = list(d.values())\n for k in v:\n if v.count(d[k]) != 1:\n del d[k]\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":1984,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-09 15:10:40","func_code":"def swap_unique_keys_values(d):\n v = list(d.values())\n for k in v:\n if v.count(d[k]) != 1:\n del d[k]\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":19643,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-09 15:11:38","func_code":"def swap_unique_keys_values(d):\n v = list(d.values())\n for k in v:\n if v.count(v[k]) != 1:\n del d[k]\n inv = {v: k for k, v in list(d.items())}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":4386,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-09 15:17:45","func_code":"def swap_unique_keys_values(d):\n inv = {v: k for k, v in list(d.items()) if v.count() == 1}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":26584,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-09 15:20:05","func_code":"def swap_unique_keys_values(d):\n vals = list(d.values())\n inv = {v: k for k, v in list(d.items()) if vals.count(v) == '1'}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":13242,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-09 15:20:22","func_code":"def swap_unique_keys_values(d):\n vals = list(d.values())\n inv = {v: k for k, v in list(d.items()) if vals.count(v) == 1}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":30012,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-09 15:20:22","func_code":"def swap_unique_keys_values(d):\n vals = list(d.values())\n inv = {v: k for k, v in list(d.items()) if vals.count(v) == 1}\n return inv","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":18534,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-03-09 15:36:53","func_code":"def swap_keys_values(d):\n newdict = {}\n keys = list(d.keys())\n values = list(d.values())\n i = 0\n while i < len(d.keys):\n newdict[keys[i]] = values[i]\n i = i + 1\n return newdict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":23305,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-03-09 15:37:10","func_code":"def swap_keys_values(d):\n newdict = {}\n keys = list(d.keys())\n values = list(d.values())\n i = 0\n while i < len(d):\n newdict[keys[i]] = values[i]\n i = i + 1\n return newdict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":36266,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-03-09 15:37:10","func_code":"def swap_keys_values(d):\n newdict = {}\n keys = list(d.keys())\n values = list(d.values())\n i = 0\n while i < len(d):\n newdict[keys[i]] = values[i]\n i = i + 1\n return newdict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":26866,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-03-09 15:42:42","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return distance - r1 - r2 < 0","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39269,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-03-09 15:42:42","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return distance - r1 - r2 < 0","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19257,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-09 16:24:44","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":39759,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-09 16:24:44","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":11536,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-09 16:28:19","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n if v not in new_dict:\n new_dict = k\n else:\n del new_dict[v]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":38875,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-09 16:29:18","func_code":"def swap_keys_values(d):\n swap1 = {}\n swap2 = {}\n swapsorted = sorted(list(d.items()), reverse=True)\n for k, v in swapsorted:\n swap1[v] = k\n swapsorted2 = sorted(list(swap1.items()), reverse=True)\n for k, v in swapsorted2:\n swap2[k] = v\n return swap2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":15295,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-09 16:29:18","func_code":"def swap_keys_values(d):\n swap1 = {}\n swap2 = {}\n swapsorted = sorted(list(d.items()), reverse=True)\n for k, v in swapsorted:\n swap1[v] = k\n swapsorted2 = sorted(list(swap1.items()), reverse=True)\n for k, v in swapsorted2:\n swap2[k] = v\n return swap2","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":28622,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-09 16:29:20","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n if v not in new_dict:\n new_dict[v] = k\n else:\n del new_dict[v]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":23246,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-09 16:29:20","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n if v not in new_dict:\n new_dict[v] = k\n else:\n del new_dict[v]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":9949,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-09 16:34:58","func_code":"def swap_unique_keys_values(d):\n swap1 = {}\n swap2 = {}\n swapsorted1 = sorted(list(d.items()), reverse=True)\n for k, v in swapsorted1:\n if v not in swap1:\n swap1[v] = k\n else:\n swap1[v] = 'N'\n swapsorted2 = sorted(list(swap1.items()), reverse=True)\n for k, v in ar2:\n if v != 'N':\n swap2[k] = v\n return swap2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":8193,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-09 16:35:19","func_code":"def swap_unique_keys_values(d):\n swap1 = {}\n swap2 = {}\n swapsorted1 = sorted(list(d.items()), reverse=True)\n for k, v in swapsorted1:\n if v not in swap1:\n swap1[v] = k\n else:\n swap1[v] = 'N'\n swapsorted2 = sorted(list(swap1.items()), reverse=True)\n for k, v in ar2:\n if v != 'N':\n swap2[k] = v\n return swap2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":70,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-09 16:35:30","func_code":"def swap_unique_keys_values(d):\n swap1 = {}\n swap2 = {}\n swapsorted1 = sorted(list(d.items()), reverse=True)\n for k, v in swapsorted1:\n if v not in swap1:\n swap1[v] = k\n else:\n swap1[v] = 'N'\n swapsorted2 = sorted(list(swap1.items()), reverse=True)\n for k, v in swapsorted2:\n if v != 'N':\n swap2[k] = v\n return swap2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":4576,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-09 16:35:30","func_code":"def swap_unique_keys_values(d):\n swap1 = {}\n swap2 = {}\n swapsorted1 = sorted(list(d.items()), reverse=True)\n for k, v in swapsorted1:\n if v not in swap1:\n swap1[v] = k\n else:\n swap1[v] = 'N'\n swapsorted2 = sorted(list(swap1.items()), reverse=True)\n for k, v in swapsorted2:\n if v != 'N':\n swap2[k] = v\n return swap2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":40157,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-03-09 16:59:42","func_code":"def swap_keys_values(d):\n new_d = {}\n mylist = list(d.items())\n i = 0\n while i < len(mylist):\n d_key = mylist[i][0]\n d_val = mylist[i][1]\n new_d[d_val] = d_key\n i += 1\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":37732,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-03-09 16:59:42","func_code":"def swap_keys_values(d):\n new_d = {}\n mylist = list(d.items())\n i = 0\n while i < len(mylist):\n d_key = mylist[i][0]\n d_val = mylist[i][1]\n new_d[d_val] = d_key\n i += 1\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35483,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-03-09 17:05:11","func_code":"def swap_keys_values(d):\n dic = {}\n for k, v in list(d.items()):\n dic[v] = k\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21191,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-03-09 17:05:11","func_code":"def swap_keys_values(d):\n dic = {}\n for k, v in list(d.items()):\n dic[v] = k\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":40938,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-03-09 17:28:45","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n val_count = {}\n mylist = list(d.items())\n i = 0\n while i < len(mylist):\n d_key = mylist[i][0]\n d_val = mylist[i][1]\n if d_val not in val_count:\n val_count[d_val] = 1\n new_d[d_val] = d_key\n else:\n val_count[d_val] = 1\n del new_d[d_val]\n i += 1\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":28563,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-03-09 17:28:45","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n val_count = {}\n mylist = list(d.items())\n i = 0\n while i < len(mylist):\n d_key = mylist[i][0]\n d_val = mylist[i][1]\n if d_val not in val_count:\n val_count[d_val] = 1\n new_d[d_val] = d_key\n else:\n val_count[d_val] = 1\n del new_d[d_val]\n i += 1\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":16127,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-03-09 17:42:51","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":19207,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-03-09 17:42:51","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":27449,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-09 18:03:55","func_code":"def swap_unique_keys_values(dictionary):\n oldkeys = []\n oldvalues = []\n swappeddict = {}\n for value in list(dictionary.values()):\n oldvalues.append(value)\n for key in list(dictionary.keys()):\n oldkeys.append(key)\n i = 0\n while i < len(oldkeys):\n swappeddict[oldvalues[i]] = oldkeys[i]\n i = i + 1\n for value in oldvalues:\n if oldvalues.count(value) == 2 and value in swappeddict:\n swappeddict.pop(value)\n return swappeddict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":23900,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-09 18:03:55","func_code":"def swap_unique_keys_values(dictionary):\n oldkeys = []\n oldvalues = []\n swappeddict = {}\n for value in list(dictionary.values()):\n oldvalues.append(value)\n for key in list(dictionary.keys()):\n oldkeys.append(key)\n i = 0\n while i < len(oldkeys):\n swappeddict[oldvalues[i]] = oldkeys[i]\n i = i + 1\n for value in oldvalues:\n if oldvalues.count(value) == 2 and value in swappeddict:\n swappeddict.pop(value)\n return swappeddict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":36932,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-03-09 18:11:16","func_code":"def swap_keys_values(d):\n dictionary = {}\n for key in d:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18886,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-03-09 18:11:16","func_code":"def swap_keys_values(d):\n dictionary = {}\n for key in d:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":12038,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-03-09 18:12:19","func_code":"def swap_unique_keys_values(d):\n dic = {}\n values = []\n notunique = []\n for key in d:\n if d[key] in values:\n notunique.append(d[key])\n else:\n values.append(d[key])\n for key in d:\n if not d[key] in notunique:\n dic[d[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":2796,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-03-09 18:12:19","func_code":"def swap_unique_keys_values(d):\n dic = {}\n values = []\n notunique = []\n for key in d:\n if d[key] in values:\n notunique.append(d[key])\n else:\n values.append(d[key])\n for key in d:\n if not d[key] in notunique:\n dic[d[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":28779,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-03-09 18:26:39","func_code":"def swap_unique_keys_values(d):\n dic = {}\n values = []\n notunique = []\n for key in d:\n if d[key] in values:\n notunique.append(d[key])\n else:\n values.append(d[key])\n for key in d:\n if not d[key] in notunique:\n dic[d[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":27180,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-03-09 18:26:39","func_code":"def swap_unique_keys_values(d):\n dic = {}\n values = []\n notunique = []\n for key in d:\n if d[key] in values:\n notunique.append(d[key])\n else:\n values.append(d[key])\n for key in d:\n if not d[key] in notunique:\n dic[d[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":38666,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-03-09 18:26:43","func_code":"def swap_keys_values(d):\n dictionary = {}\n for key in d:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":25740,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-03-09 18:26:43","func_code":"def swap_keys_values(d):\n dictionary = {}\n for key in d:\n dictionary[d[key]] = key\n return dictionary","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":38129,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-03-09 18:41:56","func_code":"def swap_keys_values(d):\n swappedDict = {}\n for i in d:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":26659,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-03-09 18:41:56","func_code":"def swap_keys_values(d):\n swappedDict = {}\n for i in d:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":16019,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-03-09 18:42:04","func_code":"def swap_unique_keys_values(d):\n swappedDict = {}\n for i in d:\n if d[i] in swappedDict:\n del swappedDict[d[i]]\n else:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":28703,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-03-09 18:42:04","func_code":"def swap_unique_keys_values(d):\n swappedDict = {}\n for i in d:\n if d[i] in swappedDict:\n del swappedDict[d[i]]\n else:\n swappedDict[d[i]] = i\n return swappedDict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":7229,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-03-09 19:13:26","func_code":"def swap_keys_values(n):\n dic = {}\n for key in n:\n dic[n[key]] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":27442,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-03-09 19:13:26","func_code":"def swap_keys_values(n):\n dic = {}\n for key in n:\n dic[n[key]] = key\n return dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":41107,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-03-09 19:13:52","func_code":"def swap_unique_keys_values(n):\n dic = {}\n values = []\n no_uni = []\n for key in n:\n if n[key] in values:\n no_uni.append(n[key])\n else:\n values, append(n[key])\n for key in n:\n if not n[key] in no_uni:\n dic[n[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":23735,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-03-09 19:14:07","func_code":"def swap_unique_keys_values(n):\n dic = {}\n values = []\n no_uni = []\n for key in n:\n if n[key] in values:\n no_uni.append(n[key])\n else:\n values.append(n[key])\n for key in n:\n if not n[key] in no_uni:\n dic[n[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":21745,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-03-09 19:14:07","func_code":"def swap_unique_keys_values(n):\n dic = {}\n values = []\n no_uni = []\n for key in n:\n if n[key] in values:\n no_uni.append(n[key])\n else:\n values.append(n[key])\n for key in n:\n if not n[key] in no_uni:\n dic[n[key]] = key\n return dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":9251,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-09 19:21:37","func_code":"def swap_keys_values(dict_descriptor):\n new_dict = {}\n for key, values in list(dict_descriptor.items()):\n new_dict[values] = keys\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":33587,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-09 19:22:08","func_code":"def swap_keys_values(dict_descriptor):\n new_dict = {}\n for keys, values in list(dict_descriptor.items()):\n new_dict[values] = keys\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":21373,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-09 19:22:08","func_code":"def swap_keys_values(dict_descriptor):\n new_dict = {}\n for keys, values in list(dict_descriptor.items()):\n new_dict[values] = keys\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":34580,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-03-09 19:54:26","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":11836,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-03-09 19:54:26","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":603,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2018-03-09 20:03:02","func_code":"def swap_keys_values(d):\n dict_ = sys.argv[1]\n new_dict = {}\n for k, v in list(dict_.items()):\n new_dict[v] = k","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":40333,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2018-03-09 20:03:57","func_code":"def swap_keys_values(d):\n new_dict = {}\n for k, v in list(d.items()):\n new_dict[v] = k","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":17928,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2018-03-09 20:05:45","func_code":"def swap_keys_values(dictionary):\n new_dict = {}\n for k, v in list(dictionary.items()):\n new_dict[v] = k","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":36130,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2018-03-09 20:07:34","func_code":"def swap_keys_values(dictionary):\n new_dict = {}\n for k, v in list(dictionary.items()):\n new_dict[v] = k","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":7697,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2018-03-09 20:08:22","func_code":"def swap_keys_values(dictionary):\n new_dict = {}\n for k, v in list(dictionary.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":16005,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2018-03-09 20:08:22","func_code":"def swap_keys_values(dictionary):\n new_dict = {}\n for k, v in list(dictionary.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":24915,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2018-03-09 20:19:20","func_code":"def swap_unique_keys_values(dictionary):\n new_dict = {}\n for k, v in list(dictionary.items()):\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":2794,"user":"156114dd-8a1c-4e95-a7b3-fb54488e2dcf","date":"2018-03-09 20:19:20","func_code":"def swap_unique_keys_values(dictionary):\n new_dict = {}\n for k, v in list(dictionary.items()):\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":24928,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-03-09 20:40:50","func_code":"def swap_keys_values(dictionary):\n new_dict = {}\n for k, v in list(dictionary.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":2469,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-03-09 20:40:50","func_code":"def swap_keys_values(dictionary):\n new_dict = {}\n for k, v in list(dictionary.items()):\n new_dict[v] = k\n return new_dict","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":30919,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-03-09 20:43:57","func_code":"def append2list(l1, l2=[]):\n newL = list(l2)\n for i in l1:\n newL.append(i)\n return newL","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":16897,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-03-09 20:52:37","func_code":"def append2list(l1, l2=[]):\n return l2 + l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":40697,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-03-09 20:52:37","func_code":"def append2list(l1, l2=[]):\n return l2 + l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3438,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-03-09 21:25:10","func_code":"def swap_unique_keys_values(dictionary):\n new_dict = {}\n for k, v in list(dictionary.items()):\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":12007,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-03-09 21:25:10","func_code":"def swap_unique_keys_values(dictionary):\n new_dict = {}\n for k, v in list(dictionary.items()):\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":41859,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-03-09 21:44:25","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":35662,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-03-09 21:49:45","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":29752,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-03-09 21:49:45","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":513,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-03-09 21:50:02","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":30480,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-03-09 21:50:02","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for k in d:\n v = d.get(k)\n if v in new_dict:\n del new_dict[v]\n else:\n new_dict[v] = k\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":8344,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-09 21:56:20","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k_v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":32073,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-09 21:57:31","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":25931,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-09 21:57:31","func_code":"def swap_unique_keys_values(d):\n d2 = {}\n d3 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d2:\n d2[v] = k\n else:\n d2[v] = 'N'\n ds2 = sorted(list(d2.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d3[k] = v\n return d3","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":2724,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-03-09 22:36:27","func_code":"def swap_unique_keys_values(d):\n new = {}\n keys = [key for key in list(d.keys())]\n values = [value for value in list(d.values())]\n for v in list(d.values()):\n if values.count(v) == 1:\n new[v] = k\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":2883,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-03-09 22:45:48","func_code":"def swap_unique_keys_values(d):\n new = {}\n keys = [k for k in list(d.keys())]\n values = [v for v in list(d.values())]\n for k, v in list(d.items()):\n if values.count(v) == 1:\n new[v] = k\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":7748,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-03-09 22:45:48","func_code":"def swap_unique_keys_values(d):\n new = {}\n keys = [k for k in list(d.keys())]\n values = [v for v in list(d.values())]\n for k, v in list(d.items()):\n if values.count(v) == 1:\n new[v] = k\n return new","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":8553,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-03-09 22:59:25","func_code":"def swap_keys_values(d):\n final = {}\n for key in d:\n final[d[key]] = key\n return final","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":34838,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-03-09 22:59:25","func_code":"def swap_keys_values(d):\n final = {}\n for key in d:\n final[d[key]] = key\n return final","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":30931,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-03-09 22:59:33","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for key in d:\n if d[key] not in new_dict:\n new_dict[d[key]] = key\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":11026,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-03-09 23:05:56","func_code":"def swap_unique_keys_values():\n d = {}\n d2 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d:\n d[v] = k\n else:\n d[v] = 'N'\n ds2 = sorted(list(d.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d2[k] = v\n return d2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":41975,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-03-09 23:06:45","func_code":"def swap_unique_keys_values(d):\n d = {}\n d2 = {}\n ds = sorted(list(d.items()), reverse=True)\n for k, v in ds:\n if v not in d:\n d[v] = k\n else:\n d[v] = 'N'\n ds2 = sorted(list(d.items()), reverse=True)\n for k, v in ds2:\n if v != 'N':\n d2[k] = v\n return d2","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":37639,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-03-09 23:08:58","func_code":"def swap_unique_keys_values(d):\n d1 = {}\n new_dict = {}\n for k, v in d:\n if d[v] not in d1:\n d1[v] = k\n else:\n d1[v] = ''\n for k, v in d1:\n if v != '':\n new_dict[k] = v\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":12061,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2018-03-09 23:10:10","func_code":"def swap_keys_values(my_dic):\n swapped_dic = {}\n dic_items = sorted(my_dic.items())\n for i in dic_items:\n key, value = i[0], i[1]\n swapped_dic[value] = key\n return swapped_dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":36971,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2018-03-09 23:10:10","func_code":"def swap_keys_values(my_dic):\n swapped_dic = {}\n dic_items = sorted(my_dic.items())\n for i in dic_items:\n key, value = i[0], i[1]\n swapped_dic[value] = key\n return swapped_dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":4403,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2018-03-09 23:10:19","func_code":"def swap_unique_keys_values(my_dic):\n unique_dic = {}\n for k, v in list(my_dic.items()):\n if v in unique_dic:\n del unique_dic[v]\n else:\n unique_dic[v] = k\n return unique_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":39337,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2018-03-09 23:10:19","func_code":"def swap_unique_keys_values(my_dic):\n unique_dic = {}\n for k, v in list(my_dic.items()):\n if v in unique_dic:\n del unique_dic[v]\n else:\n unique_dic[v] = k\n return unique_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":25217,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-03-09 23:13:58","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for key in d:\n if d[key] not in new_dict:\n new_dict[d[key]] = key\n else:\n del new_dict[d[key]]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":15999,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-03-09 23:13:58","func_code":"def swap_unique_keys_values(d):\n new_dict = {}\n for key in d:\n if d[key] not in new_dict:\n new_dict[d[key]] = key\n else:\n del new_dict[d[key]]\n return new_dict","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":37103,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-09 23:23:31","func_code":"def swap_keys_values():\n new_dic = {}\n for key in dic:\n if dic[key] not in new_dic:\n new_dic[dic[key]] = key\n return new_dic","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":34840,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-03-09 23:31:57","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for key in d:\n if d[key] not in nd:\n nd[d[key]] = key\n else:\n del nd[d[key]]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":31159,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-03-09 23:31:57","func_code":"def swap_unique_keys_values(d):\n nd = {}\n for key in d:\n if d[key] not in nd:\n nd[d[key]] = key\n else:\n del nd[d[key]]\n return nd","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":21682,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-09 23:35:11","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(dic.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":false} {"submission_id":39374,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-09 23:35:35","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":24259,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-09 23:35:35","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":34091,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-09 23:35:40","func_code":"def swap_keys_values(dic):\n return {v: k for k, v in list(dic.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":3708,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-09 23:35:40","func_code":"def swap_keys_values(dic):\n return {v: k for k, v in list(dic.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":8686,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-09 23:36:08","func_code":"def swap_unique_keys_values():\n new_dic = {}\n for key in dic:\n if dic[key] not in new_dic:\n new_dic[dic[key]] = key\n else:\n del new_dic[d[key]]\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":24433,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-09 23:37:11","func_code":"def swap_unique_keys_values(dic):\n new_dic = {}\n for key in dic:\n if dic[key] not in new_dic:\n new_dic[dic[key]] = key\n else:\n del new_dic[dic[key]]\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":42350,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-09 23:37:11","func_code":"def swap_unique_keys_values(dic):\n new_dic = {}\n for key in dic:\n if dic[key] not in new_dic:\n new_dic[dic[key]] = key\n else:\n del new_dic[dic[key]]\n return new_dic","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":3033,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-03-09 23:41:44","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":27117,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-03-09 23:41:44","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":14841,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-03-09 23:42:39","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":16614,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-03-09 23:42:39","func_code":"def swap_keys_values(d):\n return {v: k for k, v in list(d.items())}","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":20660,"user":"8fca450a-2117-453b-8f1b-f55a98c9bdb9","date":"2018-03-10 00:04:10","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":31604,"user":"8fca450a-2117-453b-8f1b-f55a98c9bdb9","date":"2018-03-10 00:04:10","func_code":"def swap_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n new_d[v] = k\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":42002,"user":"8fca450a-2117-453b-8f1b-f55a98c9bdb9","date":"2018-03-10 00:04:17","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in new_d:\n new_d[v] = k\n else:\n del new_d[v]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":19081,"user":"8fca450a-2117-453b-8f1b-f55a98c9bdb9","date":"2018-03-10 00:04:17","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n for k, v in list(d.items()):\n if v not in new_d:\n new_d[v] = k\n else:\n del new_d[v]\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":21439,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-03-10 00:37:49","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":795,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-03-10 00:37:49","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":26244,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-03-10 00:37:49","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":40283,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-03-10 01:18:11","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":18660,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-03-10 01:18:11","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":26558,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-03-10 01:33:13","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = hypot(x2 - x1, y2 - y1)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3628,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-03-10 01:33:13","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = hypot(x2 - x1, y2 - y1)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":22621,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-03-10 09:15:10","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":15290,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-03-10 09:15:10","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":20416,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-03-10 09:23:07","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = sqrt(x2 - x1 ** 2 + (y2 - y1) ** 2)\n return r1 - r2 < distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27836,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-03-10 09:23:45","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt(x2 - x1 ** 2 + (y2 - y1) ** 2)\n return r1 - r2 < distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":5357,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-03-10 09:25:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return r1 - r2 < distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":1275,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-03-10 09:28:23","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return distance <= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4388,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-03-10 09:29:58","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return distance < r1 + r2 or distance == r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":1734,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-03-10 09:33:11","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":8347,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-03-10 09:33:11","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40648,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-03-10 15:28:37","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":14446,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-03-10 15:28:37","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":16121,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-03-10 15:28:37","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":12991,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-10 16:39:15","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":15104,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-10 16:42:17","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":42163,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-10 16:45:53","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":2527,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-10 16:51:03","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":11020,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-10 16:51:03","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":17582,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-10 16:51:03","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13283,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-03-11 19:55:39","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8253,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-03-11 19:55:39","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":40844,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-03-11 20:03:13","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return math.sqrt(x2 - x1 ^ 2 + (y2 - y1) ^ 2) - r1 - r2 < 0","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":24979,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-11 20:06:53","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30396,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-03-11 20:09:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) - r1 - r2 < 0","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":36840,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-03-11 20:09:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) - r1 - r2 < 0","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":35293,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-11 20:11:00","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":26475,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-11 20:11:47","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(l1[i])\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":13537,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-11 20:12:02","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":15255,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-11 20:43:42","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8305,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-11 20:45:58","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":42258,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-11 20:46:41","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21094,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-11 20:49:19","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":25182,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-11 20:49:19","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21880,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-11 20:49:19","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1733,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 07:54:45","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":10193,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 08:03:19","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":35286,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 08:03:50","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":38722,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 09:04:00","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":10713,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 09:06:19","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13448,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-03-12 10:52:20","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13766,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-03-12 10:52:20","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":34707,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 11:06:10","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39797,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 11:13:24","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39362,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 11:13:24","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":27835,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 11:31:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if d <= r1 + r2:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3246,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 11:32:02","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if d <= r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":10297,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 11:37:39","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if d >= r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":20810,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 11:38:03","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if d < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14545,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 11:38:03","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if d < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27554,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-03-12 11:38:03","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if d < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3395,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-03-12 12:28:16","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":25601,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-03-12 12:28:16","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":41548,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-03-12 12:38:19","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 + x2) ** 2 + (y1 + y2) ** 2 <= (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":1617,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-03-12 12:40:49","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x2 - x1) ** 2 + (y2 + y1) ** 2 <= (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":11505,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-03-12 12:41:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x2 - x1) ** 2 + (y2 + y1) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":21177,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-03-12 13:04:51","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x2 - x1) ** 2 + (y2 + y1) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":38580,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-03-12 13:08:04","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt((x2 - x1) ** 2 + (y2 + y1) ** 2) < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19143,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-03-12 13:09:23","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":6506,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-03-12 13:09:56","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40553,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-03-12 13:09:56","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":8465,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-03-12 13:17:24","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":20420,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-03-12 13:20:55","func_code":"def append2list(l1, l2=None):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":40523,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-03-12 13:23:08","func_code":"def append2list(l1, l2=None):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":4521,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-03-12 13:26:40","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":28931,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-03-12 13:26:40","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":35041,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-03-12 13:53:19","func_code":"_A = None\n\n\ndef overlap(x1=_A, y1=_A, r1=_A, x2=_A, y2=_A, r2=_A):\n if x1 is _A:\n x1 = 0\n if y1 is _A:\n y1 = 0\n if r1 is _A:\n r1 = 1\n if x2 is _A:\n x2 = 0\n if y2 is _A:\n y2 = 0\n if r2 is _A:\n r2 = 1\n if ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 > float(r2) + float(r1):\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":626,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-03-12 13:55:03","func_code":"_A = None\n\n\ndef overlap(x1=_A, y1=_A, r1=_A, x2=_A, y2=_A, r2=_A):\n if x1 is _A:\n x1 = 0\n if y1 is _A:\n y1 = 0\n if r1 is _A:\n r1 = 1\n if x2 is _A:\n x2 = 0\n if y2 is _A:\n y2 = 0\n if r2 is _A:\n r2 = 1\n if ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 >= float(r2) + float(r1):\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":18879,"user":"14e87307-1c4a-4225-9151-a02ef086f467","date":"2018-03-12 13:55:03","func_code":"_A = None\n\n\ndef overlap(x1=_A, y1=_A, r1=_A, x2=_A, y2=_A, r2=_A):\n if x1 is _A:\n x1 = 0\n if y1 is _A:\n y1 = 0\n if r1 is _A:\n r1 = 1\n if x2 is _A:\n x2 = 0\n if y2 is _A:\n y2 = 0\n if r2 is _A:\n r2 = 1\n if ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 >= float(r2) + float(r1):\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":32659,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-12 14:04:56","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":11477,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-12 14:06:48","func_code":"def append2list(l1):\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":8887,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-12 14:06:48","func_code":"def append2list(l1):\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":26097,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-12 14:21:50","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x2 - x1) ** 2 + (y2 - y1) ** 2 < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":32294,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-12 14:27:31","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 - r2) ** 2 <= (x2 - x1) ** 2 + (y2 - y1) ** 2 <= r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":1247,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-12 14:28:07","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 - r2) ** 2 <= (x1 - x2) ** 2 + (y1 - y2) ** 2 <= r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":9422,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-12 14:29:41","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 - r2) ** 2 <= sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) <= r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":5772,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-12 14:32:28","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) <= r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39016,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-12 14:32:47","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (r1 - r2) ** 2 <= math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) <= r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":11524,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-12 14:33:59","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) <= (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18249,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-12 14:33:59","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) <= (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":20297,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-03-12 20:11:36","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2 = l2 + [i]\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":24377,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-03-12 20:11:36","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2 = l2 + [i]\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":622,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-03-12 20:11:36","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2 = l2 + [i]\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32463,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-03-13 00:21:05","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19509,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-03-13 00:21:05","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":29632,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-03-13 08:05:04","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7238,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-03-13 08:05:04","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8128,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-13 08:08:28","func_code":"def append2list(l1, l2=''):\n if l2 == '':\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":20840,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-13 08:08:28","func_code":"def append2list(l1, l2=''):\n if l2 == '':\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39108,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-13 08:44:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n dif = r1 - r2\n summ = r1 + r2\n if dif <= distance and summ >= distance:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":12088,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-13 08:47:45","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n dif = r1 - r2\n summ = r1 + r2\n if dif ** 2 <= distance and summ ** 2 >= distance:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":33322,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-13 09:23:17","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n summ = r1 + r2\n if summ ** 2 > distance:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3180,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-03-13 09:23:17","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n summ = r1 + r2\n if summ ** 2 > distance:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":2867,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-13 12:05:36","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n if r1 + r2 >= dist:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":6114,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-13 12:06:56","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n if r1 + r2 >= dist:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26633,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-13 12:07:30","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n if r1 + r2 > dist:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":31774,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-03-13 12:07:30","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n if r1 + r2 > dist:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":23500,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-13 12:11:21","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":27798,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-13 12:11:21","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21461,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-13 12:21:12","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n return (r1 - r2) ** 2 <= (x1 - x2) ** 2 + (y1 - y2) ** 2 <= (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":16645,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-13 12:22:03","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n return (r1 - r2) ** 2 <= (x1 - x2) ** 2 + (y1 - y2) ** 2 <= (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":10261,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-13 12:22:46","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 - r2) ** 2 <= (x1 - x2) ** 2 + (y1 - y2) ** 2 <= (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":24796,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-13 12:28:39","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) >= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41289,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-13 12:28:55","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) <= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":23854,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-13 12:29:59","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39202,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-03-13 12:29:59","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":16306,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-03-13 13:04:26","func_code":"def append2list(l1, l2=[]):\n for i in l2:\n l1.append(i)\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":19379,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-03-13 13:07:56","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8044,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-03-13 13:07:56","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":6843,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-13 18:16:48","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":31829,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-13 18:16:48","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":5156,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-13 18:16:48","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":24337,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-03-13 19:40:09","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1356,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-03-13 19:40:09","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":38673,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-03-13 19:41:58","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2\n return distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":13892,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-03-13 19:41:58","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2\n return distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":531,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-03-13 20:31:28","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":4295,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-03-13 20:31:28","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37301,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-03-13 20:49:49","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n radsum = (r1 + r2) ** 2\n if dist < radsum:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14445,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-03-13 20:58:33","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n radsum = (r1 + r2) ** 2\n raddif = (r1 - r2) ** 2\n if dist < radsum and dist > raddif:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":9167,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-03-13 20:59:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n radsum = (r1 + r2) ** 2\n raddif = math.sqrt((r1 - r2) ** 2)\n if dist < radsum and dist > raddif:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":24335,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-03-13 20:59:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n radsum = (r1 + r2) ** 2\n raddif = math.sqrt((r1 - r2) ** 2)\n if dist < radsum and dist > raddif:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":32906,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-03-13 21:03:01","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39758,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-03-13 21:03:01","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":8623,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-03-13 21:03:01","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3982,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-13 21:24:21","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8023,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-13 21:24:21","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":33165,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:26:03","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":11854,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:26:03","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":26309,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:26:03","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":18296,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:26:03","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":42261,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:26:03","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":34215,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:26:03","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":35393,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:27:23","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":7902,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:27:23","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":33845,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:27:23","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":22527,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:27:23","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":9480,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:27:23","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":11882,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:27:23","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":29098,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:27:23","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":2590,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:27:23","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":17706,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-13 21:27:23","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":33767,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-13 21:30:04","func_code":"def distance(x1, y1, x2, y2):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=0):\n distance = distance(x1, y1, x2, y2)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4555,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-13 21:30:27","func_code":"def distance(x1, y1, x2, y2):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=0):\n dist = distance(x1, y1, x2, y2)\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":1632,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-13 21:30:46","func_code":"def distance(x1, y1, x2, y2):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=0):\n dist = distance(x1, y1, x2, y2)\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3514,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-03-13 21:43:19","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n x = abs(x1 - x2)\n y = abs(y1 - y2)\n distance = x ** 2 + y ** 2\n if distance ** (1 \/ 2) >= r1 + r2:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":702,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-03-13 21:43:19","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n x = abs(x1 - x2)\n y = abs(y1 - y2)\n distance = x ** 2 + y ** 2\n if distance ** (1 \/ 2) >= r1 + r2:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":7332,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-13 21:54:32","func_code":"def distance(x1, y1, x2, y2):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = distance(x1, y1, x2, y2)\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27827,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-13 21:54:32","func_code":"def distance(x1, y1, x2, y2):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = distance(x1, y1, x2, y2)\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":16681,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-03-13 21:54:32","func_code":"def distance(x1, y1, x2, y2):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = distance(x1, y1, x2, y2)\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":6463,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-03-13 21:56:49","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32641,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-03-13 21:56:49","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":16978,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-14 10:55:57","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return r2 >= ((x1 - x2) ** 2 + (y1 - y2) ** 2 + r1) ** (1 \/ 2)","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40674,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-14 10:57:36","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 - r2) ** 2 >= (x1 - x2) ** 2 + (y1 - y2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":23756,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-14 11:09:03","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/ 2\n return distance < r1 * 2 and distance < r2 * 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":9536,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-14 11:13:08","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/ 2\n return distance < r1 * 2 or distance < r2 * 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":8974,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-14 11:13:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/ 2\n return distance <= r1 * 2 or distance <= r2 * 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27813,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-14 11:13:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/ 2\n return distance <= r1 * 2 or distance <= r2 * 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":17870,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-14 11:13:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/ 2\n return distance <= r1 * 2 or distance <= r2 * 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":17999,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:36:48","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":24869,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:36:48","func_code":"def index(str, letter):\n if letter not in str:\n print(-1)\n else:\n i = 0\n while str[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14838,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:37:19","func_code":"def index(str, letter):\n if letter not in str:\n print(-1)\n else:\n i = 0\n while str[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4585,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:37:19","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":8431,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:40:32","func_code":"def fibonacci(n):\n print(n - 1 + n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1771,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:40:32","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":5198,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:40:32","func_code":"def index(str, letter):\n if letter not in str:\n print(-1)\n else:\n i = 0\n while str[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":25006,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:41:01","func_code":"def index(str, letter):\n if letter not in str:\n print(-1)\n else:\n i = 0\n while str[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5484,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:41:01","func_code":"def fibonacci(n):\n print(n - 1 + (n - 2))","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16200,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:41:01","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":6302,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:41:54","func_code":"def index(str, letter):\n if letter not in str:\n print(-1)\n else:\n i = 0\n while str[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31681,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:41:54","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":27774,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:41:54","func_code":"def fibonacci(n):\n print(n[n - 1] + n[n - 2])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41290,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:42:48","func_code":"def fibonacci(n):\n a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n print(a[n - 1] + a[n - 2])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28960,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:42:48","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":33547,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:42:48","func_code":"def index(str, letter):\n if letter not in str:\n print(-1)\n else:\n i = 0\n while str[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":40541,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:44:48","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":27278,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:44:48","func_code":"def fibonacci(n):\n a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n if n < 1:\n print(a[n])\n elif n > 1:\n print(a[n - 1] + a[n - 2])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13282,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:44:48","func_code":"def index(str, letter):\n if letter not in str:\n print(-1)\n else:\n i = 0\n while str[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":306,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:45:33","func_code":"def index(str, letter):\n if letter not in str:\n print(-1)\n else:\n i = 0\n while str[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31005,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:45:33","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":37615,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 11:45:33","func_code":"def fibonacci(n):\n a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n if n <= 1:\n print(a[n])\n elif n > 1:\n print(a[n - 1] + a[n - 2])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1413,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:02:10","func_code":"def search(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n i = i + 1\n if letter not in a:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":30907,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:04:03","func_code":"def search(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n i = i + 1\n if letter not in a:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":24397,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:04:31","func_code":"def search(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n i = i + 1\n if letter not in a:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":15876,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:05:19","func_code":"def search(string, letter):\n return letter in string","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":19829,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 12:06:29","func_code":"def search(string, letter):\n if letter in string:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":3865,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:06:46","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":1072,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 12:06:57","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":4806,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:09:40","func_code":"def search(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n i = i + 1\n if letter not in a:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":19861,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 12:09:44","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":41466,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 12:10:22","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":34430,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:11:40","func_code":"def search(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n i = i + 1\n if letter not in a:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":16644,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:11:45","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":24088,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:12:08","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":21575,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:12:20","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str) - 1:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21172,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:12:20","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":37898,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:12:45","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str) - 1:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14356,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:12:45","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":37424,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:13:07","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":35937,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:13:07","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n print(len(str))","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4189,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:13:28","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n print(len(str))\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8756,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:13:28","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":39015,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:13:44","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29725,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:13:44","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":22534,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:13:45","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":18813,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:14:15","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":1718,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:14:27","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":15000,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:15:53","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":10515,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:16:02","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36437,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:17:02","func_code":"def search(str, letter):\n for letters in str:\n if letters in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":13123,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:17:25","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":24763,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:17:25","func_code":"def index(str, letter):\n if letter in str:\n print(letter[0])\n else:\n print(letter[-1])","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":33668,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:17:35","func_code":"def search(str, letter):\n for letters in str:\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":9198,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:17:52","func_code":"def index(str, letter):\n if letter in str:\n print(str[0])\n else:\n print(str[-1])","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28780,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:17:52","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":25621,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:18:27","func_code":"def index(str, letter):\n if letter in str:\n return str[0]\n else:\n return str[-1]","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41750,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:18:27","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":7089,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-14 12:18:41","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7308,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-03-14 12:20:08","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":41762,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:20:30","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":5428,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:20:30","func_code":"def index(str, letter):\n if letter in str:\n return pos(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13250,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:20:50","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":18505,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:20:50","func_code":"def fibonacci(n):\n list = [0, 1]\n i = 0\n while n >= len(list):\n new_num = list[i] + list[i + 1]\n list.append(new_num)\n i = i + 1\n print(list[-1])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29156,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:20:50","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2198,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 12:21:30","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":15006,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:21:31","func_code":"def fibonacci(n):\n list = []\n i = 0\n while n >= len(list):\n new_num = list[i] + list[i + 1]\n list.append(new_num)\n i = i + 1\n print(list[-1])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35487,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:21:31","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":23530,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:21:31","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16988,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 12:21:37","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":30911,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 12:21:56","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":1107,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 12:22:15","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":20009,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:22:20","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":32571,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:22:20","func_code":"def fibonacci(n):\n list = []\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i + 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n print(list[-1])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38650,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:22:20","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13940,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:22:33","func_code":"def search(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n i = i + 1\n if letter not in a:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":41632,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:22:33","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10612,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:22:34","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n print(i)\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2332,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:22:34","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":28485,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:22:46","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":30283,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:22:46","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28612,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:23:47","func_code":"def search(str, letter):\n B = False\n A = True\n for letters in str:\n statement = A\n while statement != A:\n if letter in letters:\n print(A)\n statement = B\n else:\n print(B)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":2609,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-14 12:23:52","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21413,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-03-14 12:24:05","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":22184,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-03-14 12:24:05","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(string):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11650,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-03-14 12:24:21","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38869,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-03-14 12:24:21","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":3326,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-03-14 12:24:21","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20207,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-03-14 12:24:21","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":38859,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-03-14 12:24:21","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":25405,"user":"c45598e5-3acc-4052-b18a-228b6bd842f6","date":"2018-03-14 12:24:21","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19569,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 12:24:22","func_code":"def search(str, letter):\n if letter in str:\n print(True)\n else:\n print(False)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":8638,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-14 12:24:33","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8878,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-14 12:24:33","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13517,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-14 12:24:33","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7344,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:25:06","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36027,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 12:25:27","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":2610,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 12:25:27","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n print(i)\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":22163,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:25:36","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17259,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:25:36","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n print(list[-1])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11111,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:25:36","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":23345,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 12:25:47","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30034,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 12:25:47","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":28231,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:25:51","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":8869,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:25:51","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":21276,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:25:51","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41418,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:26:34","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":13581,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:26:34","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":20875,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:26:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2915,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:26:44","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n print(position)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39787,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:26:44","func_code":"def search(string, letter):\n print(letter in string)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":17377,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 12:27:02","func_code":"def search(letter):\n str = input()\n letter = input()\n if letter in str:\n print(True)\n else:\n print(false)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":9908,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:27:17","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":39241,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:27:28","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":27541,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:27:28","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":4618,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:27:28","func_code":"def index(str, letter, num):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41667,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-03-14 12:27:30","func_code":"def search(str, letter):\n for letter in str:\n return True","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":961,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 12:27:56","func_code":"def search(letter):\n str = input()\n if letter in str:\n print(True)\n else:\n print(false)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":27288,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 12:28:00","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":5688,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:28:08","func_code":"def search(string, letter):\n return letter in string","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":25965,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:28:08","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39485,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:28:09","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":8404,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 12:28:28","func_code":"def search(letter):\n str = input()\n if letter in str:\n return True\n else:\n return false","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":37053,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:28:33","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":33308,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-03-14 12:28:36","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":27916,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 12:29:04","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":27050,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:30:00","func_code":"def index(str, letter, num):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":171,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:30:00","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":38619,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 12:30:00","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":19291,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:30:04","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":25821,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:30:04","func_code":"def fibonacci(n):\n return n","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9879,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:30:04","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28487,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:30:10","func_code":"def index(str, letter):\n if letter not in str:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30064,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:30:10","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":32040,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:30:25","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":42412,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:30:48","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":19313,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 12:30:49","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9867,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 12:30:49","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36164,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:31:27","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":8936,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:31:27","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":34967,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:31:57","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":30723,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:31:57","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str[letter]","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4736,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:32:00","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41986,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:32:00","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":13874,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:32:00","func_code":"def fibonacci(n):\n n = n - 1 + n - 2\n print(n)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":12698,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 12:32:07","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":7974,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 12:32:07","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n print(i)\n i = i + 1\n else:\n print('-1')","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18519,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:32:14","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":42419,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:32:14","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18267,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-03-14 12:32:16","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":31921,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 12:33:05","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14528,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 12:33:05","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":22704,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:33:52","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":15622,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:33:52","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return letter","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2574,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:33:57","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":20655,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:34:55","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":6398,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:34:55","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return letter.index()","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":22335,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:35:20","func_code":"def fibonacci(n):\n a, b = 1, 1\n for i in range(n - 1):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":11189,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:35:20","func_code":"def index(s, l):\n i, first = 0, -1\n while i < len(s):\n if s[i] == l:\n first = i\n break\n i += 1\n return first","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":36729,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:35:20","func_code":"def search(s, l):\n contains = False\n for c in s:\n if c == l:\n contains = True\n return contains","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":18508,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:36:24","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n print(total)\n elif n == 1:\n total = n1\n print(total)\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n print(total)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13533,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:36:24","func_code":"def search(string, letter):\n return letter in string","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":26463,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:36:24","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21768,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:36:33","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38730,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:36:33","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":13783,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:36:38","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n print(total)\n elif n == 1:\n total = n1\n print(total)\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21886,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:36:38","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2786,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:36:38","func_code":"def search(string, letter):\n return letter in string","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":3713,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:36:46","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":27044,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:36:46","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return ord(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32967,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:37:00","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26030,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:37:00","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":22990,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:37:00","func_code":"def search(string, letter):\n return letter in string","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":12931,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:37:00","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n return total\n elif n == 1:\n total = n1\n return total\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33804,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:37:00","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n return total\n elif n == 1:\n total = n1\n return total\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33603,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 12:37:00","func_code":"def search(string, letter):\n return letter in string","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":13659,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:37:20","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2295,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:37:20","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":40914,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:37:21","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return ord(letter) - 100","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35748,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:37:21","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":24748,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:37:50","func_code":"def index(s, l):\n i, first = 0, -1\n while i < len(s):\n if s[i] == l:\n first = i\n break\n i += 1\n return first","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":36095,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:37:50","func_code":"def fibonacci(n):\n if n == 0:\n a = 1\n else:\n a, b = 1, 1\n for i in range(n - 1):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":6841,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:37:50","func_code":"def search(s, l):\n contains = False\n for c in s:\n if c == l:\n contains = True\n return contains","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":21000,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:38:10","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return rdict[letter]","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10821,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:38:10","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":29321,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:38:20","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n position = 0\n if letter in str:\n position += 1\n return position\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20548,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:38:20","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":19414,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:38:20","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n position = 0\n if letter in str:\n position += 1\n return position\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16478,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:38:20","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n position = 0\n if letter in str:\n position += 1\n return position\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26977,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:38:20","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":9206,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-14 12:38:20","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":11458,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:38:24","func_code":"def index(s, l):\n i, first = 0, -1\n while i < len(s):\n if s[i] == l:\n first = i\n break\n i += 1\n return first","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":20198,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:38:24","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29448,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:38:24","func_code":"def index(s, l):\n i, first = 0, -1\n while i < len(s):\n if s[i] == l:\n first = i\n break\n i += 1\n return first","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":41957,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:38:24","func_code":"def search(s, l):\n contains = False\n for c in s:\n if c == l:\n contains = True\n return contains","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36267,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:38:24","func_code":"def search(s, l):\n contains = False\n for c in s:\n if c == l:\n contains = True\n return contains","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":8570,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:38:24","func_code":"def fibonacci(n):\n if n == 0:\n a = 0\n else:\n a, b = 1, 1\n for i in range(n - 1):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":22144,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:38:24","func_code":"def fibonacci(n):\n if n == 0:\n a = 0\n else:\n a, b = 1, 1\n for i in range(n - 1):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":26374,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:38:24","func_code":"def fibonacci(n):\n i = 0\n while i < 10:\n if n in fibonacci:\n print(n[i])\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":544,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:38:24","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":39785,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:38:24","func_code":"def fibonacci(n):\n if n == 0:\n a = 0\n else:\n a, b = 1, 1\n for i in range(n - 1):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":25116,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:38:24","func_code":"def index(s, l):\n i, first = 0, -1\n while i < len(s):\n if s[i] == l:\n first = i\n break\n i += 1\n return first","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":36428,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-14 12:38:24","func_code":"def search(s, l):\n contains = False\n for c in s:\n if c == l:\n contains = True\n return contains","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":3143,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:38:31","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":6056,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:38:47","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in int(str[i]):\n return i\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17711,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:38:47","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":13986,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:39:27","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":35386,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:39:27","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":33116,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:39:27","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num + list[i] + list[i - 1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9499,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:39:29","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4420,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:39:29","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":24898,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:39:57","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":23396,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:39:57","func_code":"def fibonacci(n):\n i = 0\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n while i < 10:\n if n in fib:\n return fib[i]\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6157,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:39:57","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35991,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:40:27","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":14529,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:40:27","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14854,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:40:34","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":19679,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:40:34","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3965,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:40:34","func_code":"def fibonacci(n):\n i = 0\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n while i < 10:\n if n in fib:\n return fib[i]\n i = i + 1\n else:\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37309,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 12:40:41","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32620,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 12:40:41","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":37149,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:40:45","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return str[i]\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23346,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:40:45","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":15314,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:41:11","func_code":"def fibonacci(n):\n i = 0\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n while i < 10:\n return fib[n]\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":31949,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:41:11","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20647,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 12:41:11","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":11812,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:42:08","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36812,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:42:08","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num + list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41401,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:42:08","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35031,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:42:31","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":2026,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:42:31","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return str[i]\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19526,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:43:13","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return str[i]\n i = i + 1\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39255,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:43:13","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":30058,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:43:19","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":12797,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:43:19","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":23532,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:43:27","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":24009,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:43:27","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":39235,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:43:37","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41348,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:43:37","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":12172,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:43:42","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35200,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:43:42","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":13284,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:44:25","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":10716,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:44:25","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12052,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:45:09","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13686,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:45:09","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":24321,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:47:06","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17681,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:47:06","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":1285,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:47:06","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num + list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i - 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27138,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:47:21","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7896,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:47:21","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36899,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:47:21","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num + list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29771,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:49:26","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":26582,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:49:26","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":28833,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:49:26","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fib(n - 2) + fib(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":911,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:49:39","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26380,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:49:39","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num + list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[+1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16891,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:49:39","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":18745,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:49:44","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":3764,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:49:44","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":2718,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 12:49:44","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":41584,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:49:49","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":23847,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:49:49","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num + list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10030,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:49:49","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":40040,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 12:51:08","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23387,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 12:51:08","func_code":"def search(string, letter):\n i = 0\n while i < len(string):\n if string[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":30662,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 12:51:11","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":9221,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 12:51:43","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":4441,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2018-03-14 12:51:43","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":15220,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:51:46","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":27891,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:51:46","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num + list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i - 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27148,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:51:46","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":14316,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:53:01","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2549,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:53:01","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":31272,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:53:05","func_code":"def fibonacci(n):\n i = 0\n j = 1\n k = 1\n while i < len(i):\n j = k\n k = k + j\n if n in k:\n return i\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30776,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:53:05","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":30108,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:53:05","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35804,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:53:25","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38508,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:53:25","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":37087,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:53:25","func_code":"def fibonacci(n):\n i = 0\n j = 1\n k = 1\n while i < n:\n j = k\n k = k + j\n if n in k:\n return i\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5286,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2018-03-14 12:54:14","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":11330,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2018-03-14 12:54:14","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n position = 0\n if letter in str:\n position = position + 1\n return position\n else:\n return str + '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17886,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2018-03-14 12:54:28","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":32987,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2018-03-14 12:54:28","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n position = 0\n if letter in str:\n position = position + 1\n return position\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13900,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2018-03-14 12:54:28","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":40302,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2018-03-14 12:54:28","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":40741,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2018-03-14 12:54:28","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n position = 0\n if letter in str:\n position = position + 1\n return position\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":24201,"user":"4490d043-a9e0-48aa-a62c-ddcc67ed7fba","date":"2018-03-14 12:54:28","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n position = 0\n if letter in str:\n position = position + 1\n return position\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30909,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 12:55:11","func_code":"def index(str, letter):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21789,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 12:55:11","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":2410,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:55:13","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":38393,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 12:55:13","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16152,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:55:30","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":39531,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:55:30","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":22962,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:55:30","func_code":"def fibonacci(n):\n i = 0\n j = 1\n k = 1\n while i < n:\n j = k\n k = k + j\n if int(n) in k:\n return i\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":496,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:56:02","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":37698,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 12:56:02","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10371,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:56:02","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17826,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 12:56:02","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":25269,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:56:02","func_code":"def fibonacci(n):\n i = 0\n j = 1\n k = 1\n while i < n:\n j = k\n k = k + j\n return k\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25326,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 12:56:06","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41789,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 12:56:06","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":19780,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:56:54","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8992,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:56:54","func_code":"def fibonacci(n):\n i = -1\n j = 1\n k = 1\n while i < n:\n j = k\n k = k + j\n return k\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8898,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:56:54","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":10444,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:57:19","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9550,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:57:19","func_code":"def fibonacci(n):\n i = -1\n j = 1\n k = 1\n while i < n:\n j = k\n k = k + j\n i = i + 1\n return k","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":24241,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:57:19","func_code":"def fibonacci(n):\n i = -1\n j = 1\n k = 1\n while i < n:\n j = k\n k = k + j\n i = i + 1\n return k","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26101,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:57:19","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":4641,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:57:19","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":22083,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:57:19","func_code":"def fibonacci(n):\n i = -1\n j = 1\n k = 1\n while i < n:\n j = k\n k = k + j\n i = i + 1\n return k","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23423,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:57:19","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":5446,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:57:19","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":20104,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-14 12:57:19","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30327,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:21","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":6618,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:21","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29735,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:21","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i - 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14797,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:34","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":7814,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:34","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":30554,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:34","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":38154,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:34","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":12074,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":40989,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:34","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":807,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":27256,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:34","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8120,"user":"18ee9049-5f05-43b2-ac53-518e3b23c3c3","date":"2018-03-14 12:58:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26738,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:58:56","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":13011,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:58:56","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":1549,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 12:58:56","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n x = 0\n y = 1\n z = 2\n for i in range(3, n):\n x = y + z\n y = z\n z = x\n return x\n else:\n retrun - 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35015,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:01:17","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7598,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:01:17","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19028,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:01:17","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":16400,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:01:17","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":30220,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:01:17","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n x = 0\n y = 1\n z = 2\n for n in range(3, n):\n x = y + z\n y = z\n z = x\n return x\n else:\n retrun - 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":31859,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:01:17","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n x = 0\n y = 1\n z = 2\n for n in range(3, n):\n x = y + z\n y = z\n z = x\n return x\n else:\n retrun - 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14520,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:01:31","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19462,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:01:31","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return F(n - 1) + F(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21970,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:01:31","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":32454,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:02:14","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33573,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:02:14","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26934,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:02:14","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":10647,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:02:14","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35959,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:02:14","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":27718,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:02:14","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38773,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 13:02:19","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":41422,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 13:02:35","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":34608,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:03:11","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":40924,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:03:11","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return F(n - 1) + F(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36064,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:03:11","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":34734,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:04:05","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":21610,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:04:05","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9073,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:04:05","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29301,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:05:17","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":26365,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:05:17","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35101,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 13:07:40","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":24451,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 13:07:42","func_code":"def fibonacci(n):\n i = 0\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987,\n 1597]\n while i < 10:\n return fib[n]\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5328,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 13:07:42","func_code":"def fibonacci(n):\n i = 0\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987,\n 1597]\n while i < 10:\n return fib[n]\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19377,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 13:07:42","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16618,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 13:07:42","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":17604,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 13:07:42","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":25419,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 13:07:42","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":25874,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 13:07:42","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":635,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 13:07:42","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":38006,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-14 13:07:42","func_code":"def fibonacci(n):\n i = 0\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987,\n 1597]\n while i < 10:\n return fib[n]\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21089,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:07:54","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":41689,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:07:54","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16885,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 13:08:23","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":39532,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:08:24","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17278,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:08:24","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10621,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:08:24","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":38801,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:09:32","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17321,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:09:32","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n return total\n elif n == 1:\n total = n1\n return total\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6482,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:09:32","func_code":"def search(string, letter):\n return letter in string","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":97,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:10:25","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8017,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:11:19","func_code":"def search(string, letter):\n i = 0\n while i < len(string):\n if string[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":4133,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:11:19","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30453,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:11:19","func_code":"def fibonacci(n):\n a, b = 1, 1\n for i in range(n - 1):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":24322,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:11:58","func_code":"def index(str, letter):\n if letter not in str:\n print(-1)\n else:\n i = 0\n while str[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31426,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:11:58","func_code":"def fibonacci(n):\n a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n if n <= 1:\n print(a[n])\n elif n > 1:\n print(a[n - 1] + a[n - 2])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":31904,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:11:58","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":23901,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:12:19","func_code":"def search(string, letter):\n i = 0\n while i < len(string):\n if string[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":16229,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:12:19","func_code":"def fibonacci(n):\n a, b = 1, 1\n for i in range(n - 1):\n a, b = b, a + b\n return a\n print(fib(5))","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":11683,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:12:19","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28089,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-03-14 13:12:20","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1097,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-03-14 13:12:20","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":1269,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-03-14 13:12:20","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36764,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-03-14 13:12:20","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7380,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-03-14 13:12:20","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39799,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-03-14 13:12:20","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30702,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:12:45","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n - 1):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26399,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:12:45","func_code":"def search(string, letter):\n i = 0\n while i < len(string):\n if string[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":13383,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:12:45","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":1723,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:14:05","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":30112,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:14:05","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":20848,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:14:05","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37204,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:14:05","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":27285,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:14:05","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":29009,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:14:05","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":21361,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:14:05","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":28969,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:14:05","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11926,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-14 13:14:05","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23835,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:14:36","func_code":"def search(string, letter):\n return letter in string","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":40376,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:14:36","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":11198,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:14:36","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n return total\n elif n == 1:\n total = n1\n return total\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":12002,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:14:36","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29257,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:14:51","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":42330,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:14:51","func_code":"def search(string, letter):\n i = 0\n while i < len(string):\n if string[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":9127,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:14:51","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20937,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:14:51","func_code":"def search(string, letter):\n i = 0\n while i < len(string):\n if string[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":28434,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:14:51","func_code":"def fibonacci(n):\n a = 0\n b = 1\n for i in range(0, n):\n temp = a\n a = b\n b = temp + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37718,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:14:51","func_code":"def fibonacci(n):\n a = 0\n b = 1\n for i in range(0, n):\n temp = a\n a = b\n b = temp + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":33919,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:14:53","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":29582,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:15:10","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while i < len(list):\n if line(str) > 1:\n nums = list[i] + list[i - 1]\n else:\n nums = list[1] - 1\n list.append(nums)\n i - 1 - i\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19094,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:15:10","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41404,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:15:10","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":19896,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:15:12","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":28705,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:15:12","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10731,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:15:12","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":16881,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:15:12","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":27805,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:15:12","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":21590,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:15:12","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":254,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:15:39","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":33830,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:16:05","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":2369,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:16:05","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while i < len(list):\n if list(str) > 1:\n nums = list[i] + list[i - 1]\n else:\n nums = list[1] - 1\n list.append(nums)\n i - 1 - i\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36396,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:16:05","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":27327,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:16:44","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":19482,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:16:44","func_code":"def index(str, letter, num):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28147,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:16:44","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while i < len(list):\n if list(str) > 1:\n nums = list[i] + list[i - 1]\n else:\n nums = list[1] - 1\n list.append(nums)\n i = 1 - i\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36613,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:16:44","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":169,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:16:44","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":27319,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:16:44","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":33272,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:17:06","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":23013,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:17:06","func_code":"def search(ls, val):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":25567,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:17:06","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":9229,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:17:06","func_code":"def search(ls, val):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":41211,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:17:06","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":18997,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-14 13:17:06","func_code":"def search(ls, val):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":19106,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:17:19","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":38481,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:17:19","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":22613,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:17:19","func_code":"def index(str, letter, num):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8314,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:17:31","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":31011,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:17:31","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":6222,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:17:31","func_code":"def index(str, letter, num):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30018,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:17:40","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if list(str) > 1:\n nums = list[i] + list[i - 1]\n else:\n nums = list[1] - 1\n list.append(nums)\n i = 1 - i\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35893,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:17:40","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26423,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:17:40","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":2665,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:17:46","func_code":"def search(str, letter):\n if letter in str:\n print(True)\n else:\n print(False)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":6037,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:17:58","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":25343,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:17:58","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":33840,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:18:12","func_code":"def search(word, letter):\n if letter in word:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:18:12","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n print('True')\n else:\n print('False')\n\n\ndef index(word, letter):\n if letter not in word:\n print(-1)\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n print(i)\n\n\ndef fibonacci(n):\n a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n if n <= 1:\n print(a[n])\n elif n > 1:\n print(a[n - 1] + a[n - 2])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20390,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:18:12","func_code":"def index(word, letter):\n if letter not in word:\n print(-1)\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18418,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:18:20","func_code":"def index(word, letter):\n if letter not in word:\n print(-1)\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6251,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:18:20","func_code":"def search(word, letter):\n if letter in word:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18117,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:18:20","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n print('True')\n else:\n print('False')\n\n\ndef index(word, letter):\n if letter not in word:\n print(-1)\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n print(i)\n\n\ndef fibonacci(n):\n a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n if n <= 1:\n print(a[n])\n elif n > 1:\n print(a[n - 1] + a[n - 2])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37700,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:18:24","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n nums = list[i] + list[i - 1]\n else:\n nums = list[1] - 1\n list.append(nums)\n i = 1 - i\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25685,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:18:24","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":22982,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:18:24","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17758,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:18:58","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13253,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:18:58","func_code":"def search(str, letter):\n for letter in str:\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":39632,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:18:58","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":39946,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:19:27","func_code":"def search(str, letter):\n if letter in str:\n print(True)\n if letter not in str:\n print(False)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":1081,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:19:39","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32799,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:19:39","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n nums = list[i] + list[i - 1]\n else:\n nums = list[i] + 1\n list.append(nums)\n i = 1 - i\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7014,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:19:39","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":1476,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:19:44","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":41855,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:19:44","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":31903,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:19:44","func_code":"def index(str, letter):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35164,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:19:47","func_code":"def search(str, letter):\n if letter in str:\n print(True)\n else:\n print(False)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":35636,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:19:56","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n return total\n elif n == 1:\n total = n1\n return total\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34325,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:19:56","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21840,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:19:56","func_code":"def search(string, letter):\n return letter in string","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":12561,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:20:23","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11734,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:20:23","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":42455,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:20:23","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":17407,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:20:44","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":26912,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:20:48","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":14610,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:20:48","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":13337,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:20:48","func_code":"def index(str, letter):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11061,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:21:33","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":15917,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:21:33","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":23153,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:21:33","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i += 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":12487,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:21:33","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39317,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:21:33","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":37657,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:21:33","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29083,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:21:33","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i += 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":6572,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:21:33","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37646,"user":"6cfd63a4-4ae6-4e36-a1eb-a1b3142265bb","date":"2018-03-14 13:21:33","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i += 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":7983,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:21:51","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n n2 = list[i] + list[i - 1]\n else:\n n2 = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32609,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:21:51","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":1885,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:21:51","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28578,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-03-14 13:22:02","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36226,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-03-14 13:22:02","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":10712,"user":"0ea9000e-74e5-4eea-8653-1bfeeae4aab1","date":"2018-03-14 13:22:02","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":4030,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:22:14","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":27243,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:22:14","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":33920,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:22:14","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28867,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:22:14","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n n2 = list[i] + list[i - 1]\n else:\n n2 = list[i] + 1\n list.append(n2)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37425,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:22:14","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n n2 = list[i] + list[i - 1]\n else:\n n2 = list[i] + 1\n list.append(n2)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":5916,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:22:14","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5558,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:22:22","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8875,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:22:22","func_code":"def index(str, letter):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23435,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 13:22:22","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":7032,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:22:29","func_code":"def search(str, letter):\n if letter in str:\n return true\n else:\n return false","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":21832,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:22:37","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":29355,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:22:37","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = 1 - i\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36276,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:22:37","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3654,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:22:42","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n return True\n else:\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n print(-1)\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n print(i)\n\n\ndef fibonacci(n):\n a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n if n <= 1:\n print(a[n])\n elif n > 1:\n print(a[n - 1] + a[n - 2])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8709,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:22:42","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":7668,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:22:42","func_code":"def index(word, letter):\n if letter not in word:\n print(-1)\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n print(i)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32520,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:22:48","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":40543,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:23:12","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n return True\n else:\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n if n <= 1:\n return a[n]\n elif n > 1:\n return a[n - 1] + a[n - 2]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10381,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:23:12","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":8387,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:23:12","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":9818,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:23:37","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = 1 - i\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6899,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:23:37","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":33056,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:23:37","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":1286,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:23:40","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4478,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:23:40","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n return total\n elif n == 1:\n total = n1\n return total\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41456,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:23:40","func_code":"def search(string, letter):\n if letter == string:\n return 'True'\n else:\n search(string[1:], letter)\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":19883,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:24:15","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":16132,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:24:15","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = 1 + i\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":32811,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:24:15","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18500,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:25:03","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36623,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:25:03","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7964,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:25:03","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":23674,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:26:13","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":19737,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:26:13","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":713,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:26:13","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n return True\n else:\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n return n - 1 + n - 2","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32604,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:26:58","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":3702,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:26:58","func_code":"def index(str, letter, num):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6023,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:26:58","func_code":"def search(str, letter):\n i = 0\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":2769,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:27:28","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":11355,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:27:28","func_code":"def index(str, letter, num):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15309,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:27:28","func_code":"def search(str, letter):\n i = 0\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":3333,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:27:56","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n return total\n elif n == 1:\n total = n1\n return total\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11310,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:27:56","func_code":"def search(string, letter):\n if letter == string:\n return 'True'\n else:\n search(string[1:], letter)\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":27406,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:27:56","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41839,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:28:57","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41955,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:28:57","func_code":"def search(string, letter):\n if letter == string:\n return 'True'\n else:\n search(string[1:], letter)\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":29095,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:28:57","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n return total\n elif n == 1:\n total = n1\n return total\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26563,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:05","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":23575,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:05","func_code":"def search(str, letter):\n i = 0\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":19288,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:05","func_code":"def index(str, letter, num):\n while num > 0:\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'\n if num > 0:\n num = num - 1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32350,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:29:13","func_code":"def search(string, letter):\n if letter == string:\n return 'True'\n else:\n search(string[1:], letter)\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":14257,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:29:13","func_code":"def search(string, letter):\n if letter == string:\n return 'True'\n else:\n search(string[1:], letter)\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":25631,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:29:13","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":647,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:29:13","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n return total\n elif n == 1:\n total = n1\n return total\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32661,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:29:13","func_code":"def search(string, letter):\n if letter == string:\n return 'True'\n else:\n search(string[1:], letter)\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":5618,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:29:13","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n return total\n elif n == 1:\n total = n1\n return total\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22026,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:29:13","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41566,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:29:13","func_code":"def fibonacci(n):\n total = 0\n n0 = 0\n n1 = 1\n if n == 0:\n total = n0\n return total\n elif n == 1:\n total = n1\n return total\n else:\n while total < n:\n n = n0 + n1\n n0 = n1\n n1 = n\n total = total + 1\n return total","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35702,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-14 13:29:13","func_code":"def index(string, letter):\n position = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n position = i\n i = i + 1\n return position","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7682,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:36","func_code":"def index(str, letter, num):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16954,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:36","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":2524,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:36","func_code":"def search(str, letter):\n i = 0\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":4985,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:36","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":13934,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:36","func_code":"def index(str, letter, num):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31219,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:36","func_code":"def index(str, letter, num):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":1098,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:36","func_code":"def search(str, letter):\n i = 0\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":1915,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:36","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":31247,"user":"1952771b-859e-46c9-8146-448dc8ef5870","date":"2018-03-14 13:29:36","func_code":"def search(str, letter):\n i = 0\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":37368,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:31:00","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":40278,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:31:00","func_code":"def index(str, letter):\n if letter in str:\n return letter[i]\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10672,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:31:46","func_code":"def index(str, letter):\n if letter in str:\n return str[letter]\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6494,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:31:46","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":24328,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:32:12","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":10192,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:32:12","func_code":"def index(str, letter):\n if letter in str:\n return str[int(letter)]\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29482,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:32:46","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":13770,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:32:46","func_code":"def index(str, letter):\n if letter in str:\n return int(letter[i])\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13096,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 13:33:28","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36069,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:33:50","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":30375,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:33:50","func_code":"def index(str, letter):\n if letter in str:\n return len(str[letter])\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29630,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:37:20","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":15416,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:37:20","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n return True\n else:\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9648,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:37:20","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":4362,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-14 13:37:34","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":17500,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-14 13:37:34","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":26489,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-14 13:37:34","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":2159,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:37:35","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n return True\n else:\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9131,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:37:35","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":5376,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:37:35","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":39278,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:38:58","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n n2 = list[i] + list[i - 1]\n else:\n n2 = list[i] + 1\n list.append(n2)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":39050,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:38:58","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26367,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:38:58","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":5822,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:38:59","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7049,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:38:59","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":24894,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:38:59","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":14510,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:38:59","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":18344,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:38:59","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":22845,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:38:59","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26239,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:39:13","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":14786,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:39:13","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":2675,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:39:36","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n return True\n else:\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16351,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:39:36","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n n2 = list[i] + list[i - 1]\n else:\n n2 = list[i] + 1\n list.append(n2)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":29616,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:39:36","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n n2 = list[i] + list[i - 1]\n else:\n n2 = list[i] + 1\n list.append(n2)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":26352,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:39:36","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":5065,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:39:36","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":30430,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:39:36","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":35485,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:39:36","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":20591,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:39:36","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":19384,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:39:36","func_code":"def index(str, letter, num):\n n = 0\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":525,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:39:36","func_code":"def index(str, letter, num):\n n = 0\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37315,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:39:36","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n n2 = list[i] + list[i - 1]\n else:\n n2 = list[i] + 1\n list.append(n2)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":3037,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-14 13:39:36","func_code":"def index(str, letter, num):\n n = 0\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35911,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:40:04","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":24969,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:40:04","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":35135,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:41:08","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":7391,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:41:08","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7737,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:41:08","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n return True\n else:\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8911,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 13:41:19","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n print(i + 1)\n else:\n print('-1')","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38740,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 13:41:19","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":6137,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:41:29","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":36247,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:41:29","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":19817,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:41:29","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37119,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:41:29","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18020,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:41:29","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13073,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:41:29","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":27741,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 13:41:41","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":30205,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 13:41:41","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n print(i)\n else:\n print('-1')","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3102,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:41:54","func_code":"def search(string, letter):\n if string == []:\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":33250,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:41:54","func_code":"def search(string, letter):\n if string == []:\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":38260,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-14 13:41:54","func_code":"def search(string, letter):\n if string == []:\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":34034,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 13:43:11","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":40482,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 13:43:11","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":20141,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 13:44:44","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30037,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 13:44:44","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":40822,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 13:44:44","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":1695,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 13:44:44","func_code":"def fibonacci(n):\n Fval = 0\n Sval = 1\n i = 0\n while i <= n:\n if n <= 1:\n return n\n else:\n Next = Fval + Sval\n Fval = Sval\n Sval = Next\n i = i + 1\n return Next","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23321,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 13:44:44","func_code":"def fibonacci(n):\n Fval = 0\n Sval = 1\n i = 0\n while i <= n:\n if n <= 1:\n return n\n else:\n Next = Fval + Sval\n Fval = Sval\n Sval = Next\n i = i + 1\n return Next","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15116,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 13:44:44","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":25557,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 13:44:44","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":27417,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 13:44:44","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21984,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-14 13:44:44","func_code":"def fibonacci(n):\n Fval = 0\n Sval = 1\n i = 0\n while i <= n:\n if n <= 1:\n return n\n else:\n Next = Fval + Sval\n Fval = Sval\n Sval = Next\n i = i + 1\n return Next","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":42234,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-03-14 13:45:56","func_code":"def search(str, letter):\n if str == []:\n return 'False'\n elif str[0] == letter:\n return 'True'\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":32997,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-03-14 13:49:12","func_code":"def search(str, letter):\n if str == '':\n return 'False'\n elif str[0] == letter:\n return 'True'\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":23930,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-03-14 13:49:12","func_code":"def search(str, letter):\n if str == '':\n return 'False'\n elif str[0] == letter:\n return 'True'\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":39020,"user":"29ee2b4b-4fb7-46c9-986d-b715bcee0fbe","date":"2018-03-14 13:49:12","func_code":"def search(str, letter):\n if str == '':\n return 'False'\n elif str[0] == letter:\n return 'True'\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":41339,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:49:53","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":7795,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:49:53","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":39456,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:49:53","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":228,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:49:53","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":31854,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:49:53","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14695,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:49:53","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":13571,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:49:53","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":30861,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:49:53","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":35207,"user":"e5dedf13-336d-484f-81bc-d7898f0f002e","date":"2018-03-14 13:49:53","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41167,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:51:15","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n return True\n else:\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39066,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:51:15","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":19119,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:51:15","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":9218,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:51:31","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":19928,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:51:31","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letters)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":32707,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:51:31","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38792,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:51:32","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":658,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:51:32","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":9534,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:51:32","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":25899,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:51:32","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":34354,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:51:32","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40873,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:51:32","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":26057,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:51:32","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":6798,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:51:32","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":15077,"user":"5bdd4d7a-504a-4b32-ac06-c9d0e6adb55a","date":"2018-03-14 13:51:32","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37530,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:51:35","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":40849,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:51:35","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":13120,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-14 13:51:35","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":14053,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 13:51:52","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":4532,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:52:48","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":23608,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:52:48","func_code":"def fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8518,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:52:48","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12778,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:53:16","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":26403,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:53:16","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18846,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:53:16","func_code":"def countdown(num=3):\n if num != 0:\n print(num)\n countdown(num - 1)\n else:\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n return True\n else:\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":29909,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:53:29","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":9716,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:53:29","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letters)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":25659,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:53:29","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29410,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:53:49","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":33036,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:53:49","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41759,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:53:49","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":33245,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:54:52","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":21006,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:54:52","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":4401,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-14 13:54:52","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":38829,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-03-14 13:56:33","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n a = (x2 - x1) ** 2\n b = (y2 - y1) ** 2\n dist = (a + b) ** (1 \/ 2)\n radius_total = r1 + r2\n return dist < radius_total","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":5309,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-03-14 13:56:33","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n a = (x2 - x1) ** 2\n b = (y2 - y1) ** 2\n dist = (a + b) ** (1 \/ 2)\n radius_total = r1 + r2\n return dist < radius_total","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":39949,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:57:58","func_code":"def countdown(num=3):\n if num != 0:\n print(num)\n countdown(num - 1)\n else:\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n return True\n else:\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":26907,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:57:58","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20552,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:57:58","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":19455,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:58:02","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":21837,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:58:02","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36185,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:58:02","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":24954,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:58:30","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":3338,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:58:30","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":12632,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:58:30","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":23033,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:58:41","func_code":"def countdown(num=3):\n if num != 0:\n print(num)\n countdown(num - 1)\n else:\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n if letter in word:\n return True\n else:\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":7213,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:58:41","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31327,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 13:58:41","func_code":"def search(word, letter):\n if letter in word:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":9926,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:01:56","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False\n\n\ndef index(word, letter):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5549,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:01:56","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":15707,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:01:56","func_code":"def index(word, letter):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5147,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:02:26","func_code":"def countdown(num=3):\n if num != 0:\n print(num)\n countdown(num - 1)\n else:\n print('LIFT OFF!')\n\n\ndef search(word, letter):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False\n\n\ndef index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8459,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:02:26","func_code":"def search(word, letter):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":23502,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:02:26","func_code":"def index(word, letter):\n if letter not in word:\n return -1\n else:\n i = 0\n while word[i] != letter:\n i = i + 1\n return i","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9289,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:02:54","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":35867,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:02:54","func_code":"def index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":8603,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:02:54","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False\n\n\ndef index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41842,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 14:03:06","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":24440,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 14:03:06","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6487,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 14:03:06","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6252,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 14:03:06","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16464,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 14:03:06","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":9017,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-14 14:03:06","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":26883,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:04:48","func_code":"def search(str, letter):\n if letter in str:\n print('True')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":8532,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:05:02","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":24139,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:05:50","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":195,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:10:53","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n print(i)\n else:\n i += 1\n print('-1')","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2728,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:10:53","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":40025,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:12:22","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":37481,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:12:22","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False\n\n\ndef index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1\n\n\ndef fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n print(a[n])","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5342,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:12:22","func_code":"def index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":6825,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:12:46","func_code":"def countdown(num=3):\n if num != 0:\n print(num)\n countdown(num - 1)\n else:\n print('LIFT OFF!')\n\n\ndef search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False\n\n\ndef index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1\n\n\ndef fibonacci(n):\n import math\n Phi = 1.61803398875\n return int((Phi ** n - (1 - Phi) ** n) \/ math.sqrt(5))","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8998,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:12:46","func_code":"def index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41647,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:12:46","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":36839,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:12:50","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False\n\n\ndef index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1\n\n\ndef fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":12368,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:12:50","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":8009,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:12:50","func_code":"def index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":34455,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:13:25","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":10027,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:13:25","func_code":"def countdown(num=3):\n while num != 0:\n print(num)\n num = num - 1\n print('LIFT OFF!')\n\n\ndef search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False\n\n\ndef index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1\n\n\ndef fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":18940,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:13:25","func_code":"def index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":6559,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:14:38","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":20353,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:14:38","func_code":"def index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":42475,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:14:38","func_code":"def index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":41690,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:14:38","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":13833,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:14:38","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":21098,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:14:38","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":472,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:16:01","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":16780,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:21:26","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":33803,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:21:26","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n print('-1')","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14462,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:21:39","func_code":"def index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41322,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:21:39","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":11359,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:21:39","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":16985,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:21:40","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":1620,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:21:40","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":1046,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:30:41","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":21102,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:30:41","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21667,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:32:06","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":9642,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:32:06","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":36501,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:17","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":22447,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:17","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fib(n - 1) + fib(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29230,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:17","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":16673,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:33","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14024,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:33","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36476,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:33","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":31384,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:34","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11053,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:34","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":38352,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31699,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:34","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":11654,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19224,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:32:34","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1844,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:35:22","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14929,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:35:22","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":31363,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:36:33","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11733,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:36:33","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28821,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 14:36:33","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":12751,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:38:34","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13446,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:38:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39602,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:38:34","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":22281,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:38:34","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":28039,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:38:34","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7933,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:38:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28098,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:38:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23149,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:38:34","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36837,"user":"bc728955-e4e8-48d1-9acb-b83b3fd023ba","date":"2018-03-14 14:38:34","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29978,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:51:04","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8296,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:51:04","func_code":"def index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16548,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:51:04","func_code":"def search(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":39048,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:52:13","func_code":"def index(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19558,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:52:13","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":32732,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:52:13","func_code":"def search(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":29091,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:52:41","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":19006,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-14 14:52:41","func_code":"def search(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":1419,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:01:13","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":34428,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:01:13","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":39009,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:01:13","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11889,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:22:58","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":7819,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:22:58","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":588,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:22:58","func_code":"def index(str, letter1, letter2):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4325,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:23:37","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":14879,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:23:37","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":60,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:23:37","func_code":"def index(str, letter1, letter2):\n i = 0\n while i < len(str):\n if str[i] == letter1:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38224,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:05","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37649,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:05","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":3557,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:05","func_code":"def index(str, letter1, letter2):\n i = 0\n while i < len(str):\n if str[i] == letter1:\n return i\n i += 1\n return '-1'\n i = 0\n while i < len(str):\n if str[i] == letter1:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29598,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:13","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":29830,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:13","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":9142,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:13","func_code":"def index(str, letter1, letter2):\n i = 0\n while i < len(str):\n if str[i] == letter1:\n return i\n i += 1\n return '-1'\n i = 0\n while i < len(str):\n if str[i] == letter2:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15331,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:13","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":35360,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:13","func_code":"def index(str, letter1, letter2):\n i = 0\n while i < len(str):\n if str[i] == letter1:\n return i\n i += 1\n return '-1'\n i = 0\n while i < len(str):\n if str[i] == letter2:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8200,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:13","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":27053,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:13","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":32899,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:13","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":24676,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-14 15:24:13","func_code":"def index(str, letter1, letter2):\n i = 0\n while i < len(str):\n if str[i] == letter1:\n return i\n i += 1\n return '-1'\n i = 0\n while i < len(str):\n if str[i] == letter2:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":27578,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-14 16:35:57","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":24819,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-14 16:36:58","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":20740,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-14 16:41:34","func_code":"def append2list(l1=[], l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7034,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-14 16:41:34","func_code":"def append2list(l1=[], l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37059,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-14 16:41:34","func_code":"def append2list(l1=[], l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":9607,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-14 16:48:09","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":15272,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-14 16:48:09","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False\n\n\ndef index(str, letter, pos):\n if pos == len(str):\n return False\n elif str[pos] == letter:\n return True\n else:\n return search(str, letter, pos)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":758,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-14 16:48:09","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36186,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-14 16:48:09","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False\n\n\ndef index(str, letter, pos):\n if pos == len(str):\n return False\n elif str[pos] == letter:\n return True\n else:\n return search(str, letter, pos)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7526,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-14 16:48:09","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False\n\n\ndef index(str, letter, pos):\n if pos == len(str):\n return False\n elif str[pos] == letter:\n return True\n else:\n return search(str, letter, pos)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":24371,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-14 16:48:09","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":40936,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:22:05","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":19135,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:22:36","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15004,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:22:36","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":12654,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:22:52","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '+1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2176,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:22:52","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":24727,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:23:12","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":25490,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:23:12","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21782,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:26:08","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":36483,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:26:08","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":1324,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:26:08","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9876,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:26:08","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29293,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:26:08","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":21392,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:26:08","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":22882,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:26:08","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19615,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:26:08","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6361,"user":"03324848-d1b1-4b00-9ab7-93d76a61a9c0","date":"2018-03-14 17:26:08","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6737,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 18:29:41","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":30594,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 18:31:32","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18767,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 18:31:32","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21375,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-03-14 18:33:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":16330,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-03-14 18:33:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":20847,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-03-14 18:33:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19927,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 18:34:41","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":27321,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 18:34:41","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11243,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 18:35:50","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19397,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 18:35:50","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":15299,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 18:36:17","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36382,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 18:36:17","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7115,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-14 18:48:27","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":8401,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-14 18:48:55","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":16448,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-14 18:56:41","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":358,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-14 18:56:41","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":10826,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-14 19:22:08","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n lenradii = r1 + r2\n distbtwnpoints = sqrt((x1 - x2) ** 2 + (y2 - y1) ** 2)\n return lenradii > distbtwnpoints","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":2553,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-03-14 19:22:08","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n lenradii = r1 + r2\n distbtwnpoints = sqrt((x1 - x2) ** 2 + (y2 - y1) ** 2)\n return lenradii > distbtwnpoints","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18424,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 19:55:11","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":7095,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 19:55:11","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fib(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34431,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 19:55:11","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37859,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 19:57:17","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31283,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 19:57:17","func_code":"def fibonacci(n):\n if n > 1:\n return fibonacci(n - 2) + fiboacci(n - 1)\n return n","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14736,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 19:57:17","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":26972,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 19:59:01","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39969,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 19:59:01","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33512,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 19:59:01","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18165,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:00:36","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37215,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:00:36","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":33855,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:00:36","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17776,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:12","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39612,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:12","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26840,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:12","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":3117,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:57","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15548,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:57","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":28364,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:57","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17849,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:57","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6707,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:57","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":24656,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:57","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":20734,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:57","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":34621,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:57","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10663,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-14 20:05:57","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":27859,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-03-14 21:41:52","func_code":"def append2list(l1, l2=[]):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37453,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-03-14 21:44:30","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":21254,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-03-14 21:54:57","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13882,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-03-14 21:54:57","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":27910,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-03-14 21:55:02","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":8065,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-03-14 21:55:02","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":35262,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-03-14 23:23:42","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":29104,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-03-14 23:23:42","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39022,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-03-14 23:28:49","func_code":"def append2list(l1, l2=[]):\n l2 = l2 + l1\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7137,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-03-14 23:28:49","func_code":"def append2list(l1, l2=[]):\n l2 = l2 + l1\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":31479,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-03-14 23:31:42","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2\n return dist","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":15031,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-03-14 23:31:42","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2\n return dist","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":37601,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-03-14 23:31:42","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2\n return dist","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":16326,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-14 23:34:18","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30855,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:34:58","func_code":"def search(str):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":9739,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:34:58","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":39324,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:34:58","func_code":"def index(str, letter):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13226,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:35:38","func_code":"def index(str):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39935,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:35:38","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":4121,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:35:38","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":21198,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:36:12","func_code":"def index(str, letter):\n if letter in str[i]:\n return [i]\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38591,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:36:12","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28572,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:36:12","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":22222,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-14 23:39:03","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":236,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-14 23:39:22","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":5713,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-14 23:40:39","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13076,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:42:57","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":7797,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:42:57","func_code":"def index(str, letter, case):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":34995,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:42:57","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":18527,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-14 23:43:04","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39139,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:43:21","func_code":"def index(str, letter, i):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21480,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:43:21","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":26569,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:43:21","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":21736,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:45:03","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":31912,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:45:03","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":604,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:45:03","func_code":"def index(str, letter, position):\n if letter in str[position]:\n return position\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6537,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:46:05","func_code":"def index(str, letter, i):\n if letter in str[i]:\n return i\n print(i)\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3976,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:46:05","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":35435,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:46:05","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":24428,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:46:23","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":30265,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:46:23","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":36798,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:46:23","func_code":"def index(str, letter, i):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13030,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-14 23:47:06","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":15008,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-03-14 23:47:31","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":35028,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-03-14 23:47:31","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18822,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-03-14 23:47:31","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14959,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:48:06","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":2753,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:48:06","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":13214,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:48:06","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":19855,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:48:06","func_code":"def index(str, letter, i):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17751,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:48:06","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28245,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:48:06","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":24005,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:48:06","func_code":"def index(str, letter, i):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15393,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:48:06","func_code":"def index(str, letter, i):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":22978,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-14 23:48:06","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":41215,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-14 23:48:39","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":16506,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-14 23:56:57","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":28889,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-14 23:57:44","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39717,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-14 23:57:44","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39843,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-14 23:57:44","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":5495,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-03-15 10:57:32","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n a = (x2 - x1) ** 2\n b = (y2 - y1) ** 2\n dist = (a + b) ** (1 \/ 2)\n radius = r1 + r2\n return dist < radius","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":14891,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-03-15 10:57:32","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n a = (x2 - x1) ** 2\n b = (y2 - y1) ** 2\n dist = (a + b) ** (1 \/ 2)\n radius = r1 + r2\n return dist < radius","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":2972,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-15 12:26:11","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37603,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-15 12:30:05","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":24547,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-03-15 12:45:33","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":33672,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-03-15 12:45:33","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":34731,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-03-15 12:51:35","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":13181,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-03-15 12:51:35","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":24174,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-03-15 13:04:18","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3101,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-03-15 13:23:08","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":5798,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-03-15 13:23:08","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7790,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-03-15 13:39:16","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":12848,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-03-15 13:39:16","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":23111,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-03-15 13:41:33","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":29950,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-03-15 13:42:20","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4952,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-03-15 13:42:20","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":337,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-15 14:07:02","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":40771,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-15 14:07:02","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30348,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-03-15 14:11:37","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n lenradii = r1 + r2\n distancebtwnpoints = sqrt((x1 - x2) ** 2 + (y2 - y1) ** 2)\n return lenradii > distancebtwnpoints","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":28429,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-03-15 14:11:37","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n lenradii = r1 + r2\n distancebtwnpoints = sqrt((x1 - x2) ** 2 + (y2 - y1) ** 2)\n return lenradii > distancebtwnpoints","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27815,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-15 14:16:25","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7705,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-15 14:16:53","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":19305,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-15 14:16:53","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":12044,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-03-15 14:23:07","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":40622,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-03-15 14:23:07","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":24790,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-15 14:23:08","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":36366,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-03-15 14:26:30","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":24772,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-03-15 14:27:25","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":1439,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-03-15 14:27:25","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":23103,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-15 14:29:05","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 + y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":21351,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-15 14:30:12","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":42,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-15 14:30:56","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":22012,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-15 14:30:56","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":18702,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-15 14:31:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 + y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":17557,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-15 14:31:19","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 + y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":35475,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-15 14:31:19","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 + y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3748,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-15 14:31:19","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 + y2) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26641,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-15 14:31:45","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":15378,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-15 14:32:24","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":36471,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-15 14:32:24","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":42120,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-15 14:33:14","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13762,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-15 14:33:14","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30982,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-03-15 14:37:32","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3783,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-03-15 14:37:32","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":12359,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-15 14:42:05","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** -1 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":15365,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-15 14:42:14","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n if (x2 - x1) ** 2 + (y2 - y1) ** -1 < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26482,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-15 14:43:39","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x2 - x1) ** 2 + (y2 - y1) ** -1 < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":13694,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-15 14:44:01","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** -1 < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":32002,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-15 14:45:19","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":25561,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-03-15 14:45:19","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":15363,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-03-15 14:46:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n import math\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if r1 + r2 >= dist:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":17506,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-15 14:46:31","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":22778,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-03-15 14:46:31","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":36743,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-15 14:46:53","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39591,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-15 14:47:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":6995,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-15 14:47:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":5795,"user":"995eab58-b496-45c9-aacf-4878531bfc6f","date":"2018-03-15 14:47:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40310,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-03-15 14:47:43","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n import math\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if r1 + r2 > dist:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":23392,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-03-15 14:47:43","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n import math\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if r1 + r2 > dist:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":23405,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-03-15 15:01:15","func_code":"def append2list(l1, l2=None):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":11322,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-03-15 15:03:02","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":34033,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-03-15 15:03:02","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":9790,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-03-15 15:03:08","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8202,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-03-15 15:03:08","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":29247,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-15 15:03:55","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3814,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-03-15 15:16:40","func_code":"def distance(x1, y1, x2, y2):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = distance(x1, y1, x2, y2)\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":2424,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-03-15 15:16:40","func_code":"def distance(x1, y1, x2, y2):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n\n\ndef overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = distance(x1, y1, x2, y2)\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":24020,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-03-15 15:35:09","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (y2 - y1) ** 2 + (x2 - x1) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26522,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-03-15 15:35:09","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (y2 - y1) ** 2 + (x2 - x1) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":25474,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-03-15 15:35:25","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n if (y2 - y1) ** 2 + (x2 - x1) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":10447,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-15 15:35:51","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if dist < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":489,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-03-15 15:35:52","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (y2 - y1) ** 2 + (x2 - x1) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":25438,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-03-15 15:35:52","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (y2 - y1) ** 2 + (x2 - x1) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27938,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-15 15:41:10","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if dist < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34249,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-15 15:41:10","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if dist < r1 + r2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4279,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-15 16:04:50","func_code":"def append2list(l1, l2=''):\n if l2 == '':\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":17957,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-03-15 16:04:50","func_code":"def append2list(l1, l2=''):\n if l2 == '':\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8301,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-15 17:40:10","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14626,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-15 17:40:10","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27443,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-03-15 17:40:10","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":1372,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-15 18:04:22","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32878,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-15 18:04:22","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":26443,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-15 18:04:22","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37707,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-15 18:17:02","func_code":"def append2list(l1, l2=None):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":20162,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-15 18:18:04","func_code":"def append2list(l1=[], l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":11875,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-15 18:21:36","func_code":"def append2list(l1=[], l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":34383,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-15 18:25:26","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n for i in l1:\n l2.append(i)\n return l2\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":10616,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-15 18:26:15","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":26359,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-15 18:29:03","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":36486,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-15 18:29:03","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":443,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-15 18:29:03","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":37824,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:10:38","func_code":"def search(string, letter):\n string = input()\n letter = input()\n if letter not in string:\n print('False')\n else:\n print('True')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":30850,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:11:08","func_code":"def search(string, letter):\n if letter not in string:\n print('False')\n else:\n print('True')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":29051,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:12:08","func_code":"def search(string, letter):\n if letter not in string:\n print('False')\n else:\n print('True')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":21204,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:12:27","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":29781,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:17:21","func_code":"def index(sting, letter):\n if letter not in string:\n print('-1')\n if letter in string:\n a = list(string)\n print(a.index(letter))","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29490,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:17:21","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":422,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:18:16","func_code":"def index(string, letter):\n if letter not in string:\n print('-1')\n if letter in string:\n a = list(string)\n print(a.index(letter))","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14826,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:18:16","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":23940,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:18:38","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":48,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:18:38","func_code":"def index(string, letter):\n if letter not in string:\n return '-1'\n if letter in string:\n a = list(string)\n return a.index(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":24469,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:18:38","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":35111,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:18:38","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":21670,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:18:38","func_code":"def index(string, letter):\n if letter not in string:\n return '-1'\n if letter in string:\n a = list(string)\n return a.index(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26004,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-15 19:18:38","func_code":"def index(string, letter):\n if letter not in string:\n return '-1'\n if letter in string:\n a = list(string)\n return a.index(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26138,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-03-15 19:24:53","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n l2.append(l1)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":23434,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-03-15 19:27:22","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":28831,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2018-03-15 19:27:22","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30269,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2018-03-15 19:27:22","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":15074,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-03-15 19:27:22","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13453,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2018-03-15 19:27:28","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":2646,"user":"539a3d07-c706-42ed-bbbe-db66980d170f","date":"2018-03-15 19:27:28","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":26900,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-03-15 19:42:43","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r2 + r1","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":27042,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-03-15 19:42:43","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r2 + r1","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":256,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-15 19:45:30","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n a = int(x1) - int(x2)\n b = int(y1) - int(y2)\n c = (a ** 2 + b * 2) ** 0.5\n return c < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34184,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-03-15 19:46:35","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if r1 + r2 >= sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2):\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":11148,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-15 19:47:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n a = int(x1) - int(x2)\n b = int(y1) - int(y2)\n c = (a ** 2 + b ** 2) ** 0.5\n return c < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":41788,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-03-15 19:47:45","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if r1 + r2 >= ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** (1 \/ 2):\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":12624,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-03-15 19:48:04","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if r1 + r2 > ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** (1 \/ 2):\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":25146,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-03-15 19:48:04","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if r1 + r2 > ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** (1 \/ 2):\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":583,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-15 19:49:36","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n a = int(x1) - int(x2)\n b = int(y1) - int(y2)\n c = (a ** 2 + b ** 2) ** 0.5\n return c < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":34594,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-15 19:50:25","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n a = int(x1) - int(x2)\n b = int(y1) - int(y2)\n c = (a ** 2 + b ** 2) ** 0.5\n return c < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":18827,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-15 19:50:25","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n a = int(x1) - int(x2)\n b = int(y1) - int(y2)\n c = (a ** 2 + b ** 2) ** 0.5\n return c < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":22562,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-15 19:50:25","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n a = int(x1) - int(x2)\n b = int(y1) - int(y2)\n c = (a ** 2 + b ** 2) ** 0.5\n return c < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":36115,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-03-15 21:07:33","func_code":"def append2list(l1, l2=[]):\n if l2 == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":2066,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-03-15 21:08:35","func_code":"def append2list(l1, l2=0):\n if l2 == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":9780,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-03-15 21:08:35","func_code":"def append2list(l1, l2=0):\n if l2 == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":23825,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-03-15 21:33:47","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n run = int(x1) - int(x2)\n rise = int(y1) - int(y2)\n dis = (run ** 2 + rise ** 2) ** 0.5\n return dis < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":41039,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-03-15 21:33:47","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n run = int(x1) - int(x2)\n rise = int(y1) - int(y2)\n dis = (run ** 2 + rise ** 2) ** 0.5\n return dis < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":37174,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 21:56:25","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":1544,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 21:56:25","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":20070,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 21:56:25","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36079,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 21:58:55","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14648,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 21:58:55","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":7547,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 21:58:55","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10452,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 21:58:55","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":34261,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 21:58:55","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41585,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 21:58:55","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13186,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 22:02:10","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":37348,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 22:02:53","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":2117,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 22:02:53","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":23719,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 22:02:53","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":16727,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 22:02:53","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":18907,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 22:02:53","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":29201,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-15 22:02:53","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":22376,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:38:04","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36955,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:38:04","func_code":"def index(str, letter, pos):\n if str[pos] == letter:\n print('1')\n else:\n print('-1')","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31088,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:40:28","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":13316,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:40:28","func_code":"def index(str, letter, pos):\n for letter in str:\n if str[pos] == letter:\n print('1')\n else:\n print('-1')","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7842,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:43:11","func_code":"def index(str, letter):\n for letter in str:\n if letter[i] == str:\n print('1')\n else:\n print('-1')","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11500,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:43:11","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":19267,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:43:40","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":11338,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:43:40","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter[i] == str:\n print('1')\n else:\n print('-1')\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5254,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:44:19","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36139,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:44:19","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter[i] == str:\n print('1')\n else:\n print('-1')\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6260,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:44:19","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter[i] == str:\n print('1')\n else:\n print('-1')\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":33483,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:44:19","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter[i] == str:\n print('1')\n else:\n print('-1')\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20737,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:44:19","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":42249,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-15 22:44:19","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":29728,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-03-15 23:14:37","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32680,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-03-15 23:14:37","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1817,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-03-15 23:17:32","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if dis < r1 + r2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":5565,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-03-15 23:17:32","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if dis < r1 + r2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":6820,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-03-15 23:17:32","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if dis < r1 + r2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":16546,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-15 23:28:52","func_code":"def append2list(l1, l=[]):\n l2 = []\n for item in l1:\n l2.append(item)\n for item in l:\n l2.append(item)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":38468,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-15 23:28:52","func_code":"def append2list(l1, l=[]):\n l2 = []\n for item in l1:\n l2.append(item)\n for item in l:\n l2.append(item)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":40733,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-15 23:28:52","func_code":"def append2list(l1, l=[]):\n l2 = []\n for item in l1:\n l2.append(item)\n for item in l:\n l2.append(item)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":29676,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-03-16 11:43:12","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1585,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-03-16 11:44:00","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":23,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-03-16 11:44:00","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":34076,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-03-16 11:44:29","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":2770,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-03-16 11:44:29","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":10886,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-16 12:58:19","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32675,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-16 13:23:13","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37647,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 13:44:44","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 - r2) * 2 <= (x1 - x2) * 2 + (y1 - y2) * 2 <= (r1 + r2) * 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39978,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 13:46:11","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 - r2) ** 2 <= (x1 - x2) ** 2 + (y1 - y2) ** 2 <= (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":2702,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 13:48:46","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 - r2) ** 2 <= (x1 - x2) ** 2 + (y1 - y2) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":32014,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-16 13:49:27","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":41101,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-16 13:50:14","func_code":"def append2list(l1, l2=[]):\n if len(l2) == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":41371,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-16 13:50:14","func_code":"def append2list(l1, l2=[]):\n if len(l2) == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":18981,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 13:58:39","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (int(r1) - int(r2)) ** 2 <= (int(x1) - int(x2)) ** 2 + (int(y1) -\n int(y2)) ** 2 < (int(r1) + int(r2)) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26946,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 14:05:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (int(r1) - int(r2)) ** 2 <= (int(x1) - int(x2)) ** 2 + (int(y1) -\n int(y2)) ** 2 < (int(r1) + int(r2)) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":9358,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-16 14:12:01","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\n return r1 + r2 > d","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":31884,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-03-16 14:12:01","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\n return r1 + r2 > d","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":33951,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-16 14:13:52","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19014,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-16 14:13:52","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19660,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 14:16:52","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 - r2) ** 2 <= (x2 - x1) ** 2 + (y2 - y1) ** 2 <= (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39667,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 14:17:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 - r2) ** 2 <= (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26053,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 14:17:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 - r2) ** 2 < (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40262,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 14:17:57","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 - r2) ** 2 <= (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41890,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 14:20:32","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return (r1 - r2) ** 2 <= (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4231,"user":"68f143f9-a076-4b95-afe1-e3828c2d0f4e","date":"2018-03-16 14:32:09","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r2 + r1","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":7986,"user":"68f143f9-a076-4b95-afe1-e3828c2d0f4e","date":"2018-03-16 14:32:09","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 < r2 + r1","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":28254,"user":"68f143f9-a076-4b95-afe1-e3828c2d0f4e","date":"2018-03-16 14:35:27","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":4816,"user":"68f143f9-a076-4b95-afe1-e3828c2d0f4e","date":"2018-03-16 14:35:27","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13825,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-03-16 15:13:25","func_code":"def append2list(l1, l2=0):\n if l2 == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":12712,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-03-16 15:13:25","func_code":"def append2list(l1, l2=0):\n if l2 == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":12999,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-03-16 15:14:18","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n run = int(x1) - int(x2)\n rise = int(y1) - int(y2)\n distance = (run ** 2 + rise ** 2) ** 0.5\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":5605,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-03-16 15:14:18","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n run = int(x1) - int(x2)\n rise = int(y1) - int(y2)\n distance = (run ** 2 + rise ** 2) ** 0.5\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":2503,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:28:30","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":7519,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:28:59","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":1692,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:29:17","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":11858,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:29:25","func_code":"def append2list(l1, l2=None):\n try:\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2\n else:\n return l1\n except ValueError:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":8461,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-16 15:30:04","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/ 2\n return dist <= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":22295,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:30:24","func_code":"def append2list(l1, l2=None):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":42087,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:31:07","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n for i in l1:\n l2.append(i)\n return l2\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":27652,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:31:35","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":24343,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:32:43","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":6712,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:32:43","func_code":"def index(str, letter):\n i = 0\n while str[i] == letter:\n i = i + 1\n if i == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41366,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:33:04","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l3 = []\n for i in l1:\n l3.append(i)\n return l3\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":40661,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:33:08","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18350,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:33:08","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter:\n i = i + 1\n if i == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32569,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:33:49","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":13585,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:33:49","func_code":"def index(str, letter):\n i = 0\n while str[i - 1] != letter:\n i = i + 1\n if i == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":25863,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:34:11","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter:\n i = i + 1\n if i == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11774,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:34:11","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":1904,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:34:29","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter:\n return i\n i = i + 1\n if i == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18549,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:34:29","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":5883,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:35:33","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":32599,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:35:33","func_code":"def index(str, letter):\n return len(str)\n i = 0\n while str[i] != letter:\n i = i + 1\n if i == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12709,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:36:36","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter and i < len(str):\n i = i + 1\n if i == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":27064,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:36:36","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":11325,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:37:01","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter and i < len(str) - 1:\n i = i + 1\n if i == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8729,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:37:01","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18540,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:37:37","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt(x2 + y2 + (x1 + y1)) > r2 + r1:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":6209,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:38:05","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36905,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:38:05","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt(x2 + y2 + (x1 + y1)) > math.sqrt(r2 + r1):\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26372,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:38:05","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter and i < len(str) - 1:\n i = i + 1\n if i + 1 == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28662,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:38:17","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt(x2 + y2 + (x1 + y1)) < math.sqrt(r2 + r1):\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34422,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:39:17","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt(x2 + y2 + (x1 + y1)) < math.sqrt(r2 + r1) < math.sqrt(x2 -\n y2 + (x1 - y1)):\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":9119,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:39:45","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt(x2 - y2 + (x1 - y1)) < math.sqrt(r2 + r1) < math.sqrt(x2 +\n y2 + (x1 + y1)):\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":12702,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:43:05","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt(x2 + y2 + (x1 + y1)) < r2 + r1:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":13243,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:43:33","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt(x2 - y2 + (x1 - y1)) < r2 + r1:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":21247,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:44:15","func_code":"def fibonacci(n):\n a = [0, 1]\n total = 0\n i = 1\n while i < n:\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34481,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:44:15","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":5038,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:44:15","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter and i < len(str) - 1:\n i = i + 1\n if i + 1 == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16107,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:44:36","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if math.sqrt((x2 - y2) ** 2 + (x1 - y1) ** 2) < r2 + r1:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":20278,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-03-16 15:44:51","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30544,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-03-16 15:44:51","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":23655,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:45:35","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":26684,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:45:35","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter and i < len(str) - 1:\n i = i + 1\n if i + 1 == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11222,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:45:35","func_code":"def fibonacci(n):\n a = [0, 1]\n total = 0\n i = 0\n while i < n + 1:\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":2294,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:45:37","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt(9)\n return distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":38805,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:48:11","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n sumofrads = r1 + r2\n if distance < sumofrads:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":33441,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 15:48:11","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n sumofrads = r1 + r2\n if distance < sumofrads:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34406,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:49:26","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter and i < len(str) - 1:\n i = i + 1\n if i + 1 == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6520,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:49:26","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":9720,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:49:26","func_code":"def fibonacci(n):\n a = [0, 1]\n total = 0\n i = 0\n while i < n + 1:\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":34242,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:49:26","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter and i < len(str) - 1:\n i = i + 1\n if i + 1 == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12975,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:49:26","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":16442,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-16 15:49:26","func_code":"def fibonacci(n):\n a = [0, 1]\n total = 0\n i = 0\n while i < n + 1:\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":17249,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-16 15:52:08","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/\/ 2\n return distance <= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":5884,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-16 15:52:08","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/\/ 2\n return distance <= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3741,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-03-16 15:52:08","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 1 \/\/ 2\n return distance <= r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":6958,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-16 16:19:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n size = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return size < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3823,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-03-16 16:19:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n size = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return size < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":29219,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-16 16:41:51","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":6015,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-16 17:07:51","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3434,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-16 17:09:58","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":34992,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-16 17:09:58","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":40948,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-03-16 17:12:00","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return d < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":33044,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-03-16 17:12:00","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return d < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":8470,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-03-16 17:31:27","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41635,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-03-16 17:31:27","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39922,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-16 17:32:12","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41438,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-16 17:32:12","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":20694,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-03-16 17:33:06","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":35466,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-03-16 17:33:06","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":26949,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-16 17:33:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":9402,"user":"07a2a74b-d2da-4f91-ba7e-5881b51fd5e4","date":"2018-03-16 17:33:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":18664,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 17:42:25","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l3 = []\n for i in l1:\n l3.append(i)\n return l3\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":8604,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 17:44:57","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":10798,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 17:48:19","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":24431,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 17:48:57","func_code":"def append2list(l1=None, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":22425,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 17:53:51","func_code":"_A = None\n\n\ndef append2list(l1=_A, l2=_A):\n if l2 is _A:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2\n elif l1 is _A:\n l1 = []\n for i in l2:\n l1.append(i)\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":25372,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-03-16 17:58:16","func_code":"def append2list(l1, l2=0):\n if l2 == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39868,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-03-16 17:58:16","func_code":"def append2list(l1, l2=0):\n if l2 == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":16240,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-03-16 17:58:26","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n run = int(x1) - int(x2)\n rise = int(y1) - int(y2)\n distance = (run ** 2 + rise ** 2) ** 0.5\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":21835,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-03-16 17:58:26","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n run = int(x1) - int(x2)\n rise = int(y1) - int(y2)\n distance = (run ** 2 + rise ** 2) ** 0.5\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":39414,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-03-16 17:58:26","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n run = int(x1) - int(x2)\n rise = int(y1) - int(y2)\n distance = (run ** 2 + rise ** 2) ** 0.5\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":12620,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-03-16 18:08:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":35962,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-03-16 18:08:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":13523,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-03-16 18:08:15","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":23651,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-03-16 18:08:15","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":35307,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-03-16 18:16:03","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30624,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-03-16 18:16:03","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":35428,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-03-16 18:16:30","func_code":"def append2list(l1, l2=[]):\n return l2 + l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8581,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-03-16 18:16:30","func_code":"def append2list(l1, l2=[]):\n return l2 + l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":22190,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-03-16 18:16:30","func_code":"def append2list(l1, l2=[]):\n return l2 + l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":39150,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-03-16 18:18:49","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":40520,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-03-16 18:18:49","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n return distance < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":3715,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-16 18:21:41","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":586,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-03-16 18:42:23","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":11051,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-03-16 18:42:23","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":2837,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 19:13:05","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13645,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-16 19:16:06","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":17021,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 19:19:20","func_code":"def append2list(l1, l2=[]):\n newlist = []\n for i in l2:\n newlist.append(i)\n for i in l1:\n newlist.append(i)\n return newlist","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":19520,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 19:19:20","func_code":"def append2list(l1, l2=[]):\n newlist = []\n for i in l2:\n newlist.append(i)\n for i in l1:\n newlist.append(i)\n return newlist","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30179,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-16 19:21:08","func_code":"def append2list(l1, l2):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":17488,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 19:23:32","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n l3 = l1 + l2\n return l3","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":6575,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 19:24:21","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":19530,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-16 19:42:56","func_code":"def append2list(l1, l2=[]):\n if len(l2) == 2:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":40360,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-16 19:45:07","func_code":"def append2list(l1=[], l2=''):\n l2 = list(l2)\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":27752,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-16 19:45:07","func_code":"def append2list(l1=[], l2=''):\n l2 = list(l2)\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":17695,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-16 19:46:48","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":5719,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-16 19:46:48","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":29523,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 19:46:56","func_code":"def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):\n r = d3 + d6\n r = r * r\n d = (d1 - d4) * (d1 - d4) - (d2 - d5) * (d2 - d5)\n if r == d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":10279,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-16 19:48:35","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27186,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-03-16 19:48:35","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":22758,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 19:49:35","func_code":"def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):\n r = d3 + d6\n r = r * r\n d = (d1 - d4) * (d1 - d4) - (d2 - d5) * (d2 - d5)\n if r > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":2722,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 19:49:56","func_code":"def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):\n r = d3 + d6\n r = r * r\n d = (d1 - d4) * (d1 - d4) - (d2 - d5) * (d2 - d5)\n if r >= d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19869,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 19:50:33","func_code":"def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):\n r = d3 + d6\n d = (d1 - d4) * (d1 - d4) - (d2 - d5) * (d2 - d5)\n if r >= d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":35966,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-16 19:51:22","func_code":"def append2list(l1, l2=None):\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":31075,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-03-16 19:52:40","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":24420,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-03-16 19:52:40","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26175,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 19:53:22","func_code":"def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):\n r = d3 + d6\n d = math.sqrt((d1 - d4) ** 2) - (d2 - d5) ** 2\n if r >= d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":34862,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 19:54:35","func_code":"def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):\n import math\n r = d3 + d6\n d = math.sqrt((d1 - d4) ** 2) - (d2 - d5) ** 2\n if r >= d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18817,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-16 19:55:50","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n d = (x2 - x1) ** 2 + (y2 - y1) * 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":30994,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-16 19:56:05","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n d = (x2 - x1) ** 2 + (y2 - y1) * 2\n if d < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3731,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-16 19:56:52","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n d = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if d < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":22096,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-03-16 19:56:52","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=1):\n d = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if d < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":10881,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 19:58:06","func_code":"def overlap(d1=0, d2=0, d3=0, d4=0, d5=0, d6=0):\n import math\n r = d3 + d6\n d = (d1 - d4) ** 2 - (d2 - d5) ** 2\n d = math.sqrt(d)\n if r >= d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":21810,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-16 20:00:38","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":33718,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-16 20:00:38","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":16962,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-03-16 20:03:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":35981,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-03-16 20:03:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14730,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-03-16 20:03:56","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":19718,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-03-16 20:03:56","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":24490,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 20:05:39","func_code":"def overlap(d1=0, d2=0, d3=1, d4=0, d5=0, d6=1):\n import math\n r = d3 + d6\n d = (d1 - d4) ** 2 - (d2 - d5) ** 2\n d = math.sqrt(d)\n if r >= d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26997,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-03-16 20:05:41","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":2140,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-03-16 20:05:41","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41897,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-16 20:07:14","func_code":"def overlap(x1=0, y1=0, x2=0, y2=0, r1=1, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":25174,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 20:09:00","func_code":"def overlap(d1=0, d2=0, d3=1, d4=0, d5=0, d6=1):\n import math\n r = d3 + d6\n x = (d1 - d4) ** 2\n y = (d2 - d5) ** 2\n d = x + y\n d = math.sqrt(d)\n if r >= d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26793,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 20:10:00","func_code":"def overlap(d1=0, d2=0, d3=1, d4=0, d5=0, d6=1):\n import math\n r = d3 + d6\n x = (d1 - d4) ** 2\n y = (d2 - d5) ** 2\n d = x + y\n d = math.sqrt(d)\n if r > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":30518,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-03-16 20:10:13","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":10263,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-03-16 20:10:13","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":30949,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 20:10:44","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n l2.append(l1)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":31413,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 20:10:58","func_code":"def overlap(d1=0, d2=0, d3=1, d4=0, d5=0, d6=1):\n r = d3 + d6\n r = r ** 2\n x = (d1 - d4) ** 2\n y = (d2 - d5) ** 2\n d = x + y\n if r > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":13580,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 20:11:21","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n l2.append(l1)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":28418,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 20:11:49","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n l2.append(l1)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":35649,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-16 20:12:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":13988,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-03-16 20:12:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18075,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-03-16 20:12:27","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":37946,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-03-16 20:12:27","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19985,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 20:15:11","func_code":"def overlap(d1=0, d2=0, d3=1, d4=0, d5=0, d6=1):\n import math\n r = d3 + d6\n d = math.sqrt((d1 - d4) ** 2 + (d2 - d5) ** 2)\n if r > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":29467,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-16 20:16:20","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":39568,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-16 20:16:20","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27244,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 20:20:52","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(l1)\n return l2\n else:\n return [l1, l2]","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":6370,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-16 20:29:26","func_code":"def append2list(l1, l2=0):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7197,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-16 20:30:07","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8771,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2018-03-16 20:31:35","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":771,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2018-03-16 20:31:35","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":36334,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2018-03-16 20:31:47","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":37159,"user":"03ce4b42-26f0-456c-9d48-18c0d16bec55","date":"2018-03-16 20:31:47","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14862,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-16 20:33:13","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7937,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-16 20:33:34","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":17306,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-16 20:34:02","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":2629,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-03-16 20:34:02","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":14148,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 20:36:20","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":14351,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-03-16 20:36:20","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":29481,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-03-16 20:36:28","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":25234,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-03-16 20:36:28","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":23244,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-03-16 20:36:28","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":10959,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-16 20:41:03","func_code":"def append2list(l1, l2=0):\n if l2 == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30039,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-16 20:41:03","func_code":"def append2list(l1, l2=0):\n if l2 == 0:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":40828,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-03-16 20:46:53","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":7478,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-03-16 20:46:53","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":33042,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-03-16 20:47:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":10813,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-03-16 20:47:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":23309,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-03-16 20:47:29","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":12269,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-03-16 20:48:22","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":2759,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-03-16 20:48:22","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4502,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-03-16 20:48:57","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":5383,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-03-16 20:48:57","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":19997,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-03-16 20:48:57","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":15431,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-03-16 20:49:07","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37544,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-03-16 20:49:07","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":34759,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-03-16 20:51:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":1357,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-03-16 20:51:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":20752,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-03-16 20:51:20","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32957,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-03-16 20:51:20","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":2799,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-16 20:54:15","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":36318,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-16 20:55:08","func_code":"def append2list(l1, l2=[]):\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":15926,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-16 21:01:26","func_code":"def append2list(l1, l2=[]):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":24519,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-16 21:02:36","func_code":"def append2list(l1, l2=None):\n for i in l1:\n if l2 == None:\n l2 = []\n l2.append(i)\n else:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8479,"user":"7d02a9ff-65b9-4dbf-909b-9668940c661b","date":"2018-03-16 21:02:36","func_code":"def append2list(l1, l2=None):\n for i in l1:\n if l2 == None:\n l2 = []\n l2.append(i)\n else:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":8054,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-16 21:03:24","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":18421,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-16 21:03:24","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1214,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-03-16 21:09:58","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":35433,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-16 21:12:57","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":33570,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-16 21:12:57","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = math.floor(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2))\n return r1 + r2 > distance","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":30013,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-03-16 21:14:52","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":36315,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-03-16 21:14:52","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1112,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-03-16 21:15:45","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return r1 + r2 > dist","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":25554,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-03-16 21:15:45","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return r1 + r2 > dist","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18797,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-03-16 21:16:30","func_code":"def append2list(l1, l2=[]):\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":35379,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-16 21:16:57","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37737,"user":"df3b8d82-7372-4e43-b692-9ab72c754509","date":"2018-03-16 21:16:57","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3815,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-03-16 21:23:09","func_code":"def append2list(l1, l2=[]):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":13034,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-03-16 21:24:08","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":34166,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-03-16 21:24:08","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":32438,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-03-16 21:27:47","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if dist < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41122,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-03-16 21:27:47","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if dist < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18685,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-16 21:40:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":1104,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-03-16 21:40:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":3660,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-03-16 22:17:57","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n length = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if length < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":1898,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-16 22:20:17","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":38135,"user":"e0141b22-9477-459d-8e1c-18f5d5ef6624","date":"2018-03-16 22:20:17","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":8243,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-03-16 22:20:39","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n length = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if length < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":5201,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-03-16 22:20:39","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n length = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if length < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":13989,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-16 22:33:47","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3938,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-16 22:33:47","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":6089,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-16 22:42:57","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":8354,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-16 22:42:57","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":37631,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-03-16 22:42:57","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14599,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 23:00:44","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) - r1 - r2 < 0","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":23475,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-03-16 23:00:44","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) - r1 - r2 < 0","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":7830,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-03-16 23:17:51","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":28247,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-03-16 23:17:51","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30232,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-03-16 23:18:05","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":29379,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-03-16 23:18:05","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40996,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-03-16 23:18:05","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":27596,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-16 23:19:05","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36452,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-16 23:19:05","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n index = letter.index('str')\n if str[i] == letter:\n return index\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3880,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-16 23:19:05","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n index = letter.index('str')\n if str[i] == letter:\n return index\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":42321,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-16 23:19:05","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n index = letter.index('str')\n if str[i] == letter:\n return index\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":1160,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-03-16 23:19:05","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":23705,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-16 23:19:05","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":2181,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-16 23:19:05","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":39880,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-03-16 23:19:05","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":25207,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-03-16 23:19:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":1188,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-03-16 23:19:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":22816,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-03-16 23:19:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n radiuses = r1 + r2\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if distance < radiuses:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14895,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:37:59","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n r = r1 + r2\n d = (d1 - d4) ** 2 + (d2 - d5) ** 2\n if r ** 2 > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40875,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:38:40","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n r = r1 + r2\n d = (x2 - x1) ** 2 + (y2 - x1) ** 2\n if r ** 2 > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":5116,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:40:33","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n r = (r1 + r2) ** 2\n d = (x2 - x1) ** 2 + (y2 - x1) ** 2\n if r > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18243,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:43:10","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n r = (r1 + r2) ** 2\n d = (x2 - x1) ** 2 + (y2 - x1) ** 2\n if r > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":8516,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:44:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n r = r1 + r2\n d = (x2 - x1) ** 2 + (y2 - x1) ** 2\n if r ** 2 > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":16217,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:45:53","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = (x2 - x1) ** 2 + (y2 - x1) ** 2\n if (r1 + r2) ** 2 > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":31371,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:47:20","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = (x2 - x1) ** 2 + (y2 - x1) ** 2\n if (r1 + r2) ** 2 > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":29812,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:48:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n d = (x2 - x1) ** 2 + (y2 - x1) ** 2\n if (r1 + r2) ** 2 >= d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41932,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:50:54","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n import math\n d = (x2 - x1) ** 2 + (y2 - x1) ** 2\n if r1 + r2 >= math.sqrt(d):\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26411,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:52:45","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n import math\n d = math.sqrt((x2 - x1) ** 2 + (y2 - x1) ** 2)\n if r1 + r2 >= d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":30069,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:52:59","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n import math\n d = math.sqrt((x2 - x1) ** 2 + (y2 - x1) ** 2)\n if r1 + r2 > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":21868,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-03-16 23:53:10","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if dis < r1 + r2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40557,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-03-16 23:53:10","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dis = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n if dis < r1 + r2:\n return True\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26099,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:55:23","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n import math\n r = r1 + r2\n d = math.sqrt((x2 - x1) ** 2 + (y2 - x1) ** 2)\n print((r, d))\n if r > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":5995,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-03-16 23:57:54","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":1367,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-03-16 23:57:54","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":36608,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-03-16 23:57:54","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30954,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:58:06","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n import math\n r = r1 + r2\n d = (x2 - x1) ** 2 + (y2 - x1) ** 2\n d = math.sqrt(d)\n print((r, d))\n if r > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":37247,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:59:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n import math\n r = r1 + r2\n d = (x1 - x2) ** 2 + (y1 - x2) ** 2\n d = math.sqrt(d)\n print((r, d))\n if r > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":23792,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:59:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n import math\n r = r1 + r2\n d = (x1 - x2) ** 2 + (y1 - x2) ** 2\n d = math.sqrt(d)\n print((r, d))\n if r > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3150,"user":"8f0fb5da-2965-4add-800c-347702711f78","date":"2018-03-16 23:59:34","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n import math\n r = r1 + r2\n d = (x1 - x2) ** 2 + (y1 - x2) ** 2\n d = math.sqrt(d)\n print((r, d))\n if r > d:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":6920,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-18 09:15:48","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":33533,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-18 09:15:48","func_code":"def search(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":1635,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-18 09:16:26","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":5445,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-18 09:16:26","func_code":"def search(ls, val, na=0):\n pos = len(ls)\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)\n\n\ndef index(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":34643,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-18 09:16:26","func_code":"def search(ls, val, na=0):\n pos = len(ls)\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)\n\n\ndef index(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30153,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-18 09:16:26","func_code":"def search(ls, val, na=0):\n pos = len(ls)\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)\n\n\ndef index(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7062,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-18 09:16:26","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":23061,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-18 09:16:26","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":4986,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-18 09:16:26","func_code":"def search(ls, val, na=0):\n pos = len(ls)\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":3286,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-18 09:16:26","func_code":"def search(ls, val, na=0):\n pos = len(ls)\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":1039,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-18 09:16:26","func_code":"def search(ls, val, na=0):\n pos = len(ls)\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":32154,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:19:56","func_code":"def search(str, letter):\n i = 0\n if letter == str[i]:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":29716,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:19:56","func_code":"def fibonacci(n):\n a = [0, 1]\n if len(a) == n + 1:\n print(a[n])\n else:\n total = int(a[n]) + int(a[n + 1])\n a.append(total)\n fibonacci(n + 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39059,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:22:02","func_code":"def fibonacci(n):\n a = [0, 1]\n if n == len(a):\n return a[n]\n else:\n total = int(a[n]) + int(a[n + 1])\n a.append(total)\n fibonacci(n + 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20835,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:22:02","func_code":"def search(str, letter):\n i = 0\n if letter == str[i]:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":15216,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:23:55","func_code":"def fibonacci(n):\n a = [0, 1]\n if n < i:\n return a[n]\n else:\n i = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":12876,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:23:55","func_code":"def search(str, letter):\n i = 0\n if letter == str[i]:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":23689,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:24:33","func_code":"def search(str, letter):\n i = 0\n if letter == str[i]:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":39405,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:24:33","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n < i:\n return a[n]\n else:\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11835,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:27:49","func_code":"def fibonacci(n):\n i = 0\n original = n\n a = [0, 1]\n if n == 0:\n return a[original]\n else:\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6759,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:27:49","func_code":"def search(str, letter):\n i = 0\n if letter == str[i]:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":13136,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:29:44","func_code":"def search(str, letter):\n i = 0\n if letter == str[i]:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":10234,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:29:44","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39899,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:30:01","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a) - 1]\n else:\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":3521,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:30:01","func_code":"def search(str, letter):\n i = 0\n if letter == str[i]:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":2151,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:30:22","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a) - 2]\n else:\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17117,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:30:22","func_code":"def search(str, letter):\n i = 0\n if letter == str[i]:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28745,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:31:43","func_code":"def search(str, letter):\n i = 0\n if letter == str[i]:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28513,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:31:43","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a) - 2]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41262,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:33:03","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a) - 2]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n return n\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37966,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:33:03","func_code":"def search(str, letter):\n i = 0\n if letter == str[i]:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":15796,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:38:06","func_code":"def search(str, letter):\n i = 0\n if letter == str[i]:\n return 'True'\n else:\n return 'False'\n i = i + 1","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":35615,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:38:06","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28689,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:43:34","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7111,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:43:34","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":34436,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:49:50","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":868,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:49:50","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":5977,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:50:59","func_code":"def search(str, letter):\n if str == []:\n return 'False'\n elif str[0] == letter:\n return 'True'\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":29332,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:50:59","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":24930,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:51:53","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":1462,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:51:53","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19435,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:52:09","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":26986,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:52:09","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28458,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:54:16","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":3248,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:54:16","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":21408,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:58:19","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":1222,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:58:19","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26894,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 17:58:19","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)\n\n\ndef index(str, letter):\n if len(str) == 0:\n return -1\n elif str[0] == letter:\n return\n else:\n return search(str[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5859,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:04:32","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":25189,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:04:32","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34763,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:04:32","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)\n\n\ndef index(str, letter):\n if len(str) == 0:\n return -1\n elif str[len(str)] == letter:\n return len(str)\n else:\n return search(str[:len(str)], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":33016,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:05:14","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":28216,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:05:14","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40084,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:05:14","func_code":"def index(str, letter):\n if len(str) == 0:\n return -1\n elif str[len(str)] == letter:\n return len(str)\n else:\n return index(str[:len(str)], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":24192,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:05:39","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33273,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:05:39","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":13801,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:05:39","func_code":"def index(str, letter):\n if len(str) == 0:\n return -1\n elif str[len(str)] == letter:\n return len(str)\n else:\n return index(str[:len(str)], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28617,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:05:58","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":25358,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:05:58","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32710,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:05:58","func_code":"def index(str, letter):\n if len(str) == 0:\n return -1\n elif str[len(str)] == letter:\n return int(len(str))\n else:\n return index(str[:len(str)], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":40833,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:13","func_code":"def index(str, letter):\n if len(str) == 0:\n return -1\n elif str[len(str)] == letter:\n print(int(len(str)))\n else:\n return index(str[:len(str)], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15511,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:13","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":31915,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:13","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8471,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:37","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":37338,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:37","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter and i < len(str) - 1:\n i = i + 1\n if i + 1 == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":22668,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:37","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":39470,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:37","func_code":"def fibonacci(n):\n a = [0, 1]\n total = 0\n i = 0\n while i < n + 1:\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":33832,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:37","func_code":"def index(str, letter):\n i = 0\n while str[i] != letter and i < len(str) - 1:\n i = i + 1\n if i + 1 == len(str):\n return '-1'\n else:\n return i","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":36179,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:37","func_code":"def fibonacci(n):\n a = [0, 1]\n total = 0\n i = 0\n while i < n + 1:\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":23902,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:51","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":34647,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:51","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":24029,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:06:51","func_code":"def index(str, letter):\n if len(str) == 0:\n return -1\n elif str[len(str)] == letter:\n print(int(len(str)))\n else:\n return index(str[:len(str)], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16047,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:08:56","func_code":"def index(str, letter, pos):\n if len(str) == 0:\n return -1\n elif str[pos] == letter:\n print(pos)\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8796,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:08:56","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18557,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:08:56","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":36320,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:09:17","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8151,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:09:17","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":16014,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:09:17","func_code":"def index(str, letter, pos):\n if len(str) == 0:\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":25068,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:09:51","func_code":"def fibonacci(n):\n i = 0\n a = [0, 1]\n if n == 0:\n return a[len(a)]\n else:\n total = 0\n total = int(a[i]) + int(a[i + 1])\n a.append(total)\n i = i + 1\n fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21475,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:09:51","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":30987,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:09:51","func_code":"def index(str, letter, pos):\n if len(str) - 1 == pos:\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31964,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:17:54","func_code":"def index(str, letter, pos):\n if len(str) - 1 == pos:\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29705,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:17:54","func_code":"def fibonacci(n):\n a = [0, 1]\n if n == len(a) - 1:\n return a[n]\n elif n != len(a) - 1:\n a.append(int(a[len(a) - 1] + a[len(a) - 2]))\n else:\n return fibonacci(n)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38007,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:17:54","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":42208,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:20:54","func_code":"def index(str, letter, pos):\n if len(str) - 1 == pos:\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3883,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:20:54","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":19697,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:20:54","func_code":"def fibonacci(n):\n if n == len(a) - 1:\n return a[n]\n elif n != len(a) - 1:\n a.append(int(a[len(a) - 1] + a[len(a) - 2]))\n else:\n return fibonacci(n)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38825,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:21:30","func_code":"def fibonacci(n):\n if n == len(a):\n return a[n]\n elif n != len(a) - 1:\n a.append(int(a[len(a) - 1] + a[len(a) - 2]))\n else:\n return fibonacci(n)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7894,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:21:30","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":37060,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:21:30","func_code":"def index(str, letter, pos):\n if len(str) - 1 == pos:\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26930,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:02","func_code":"def fibonacci(n):\n if n == len(a):\n return a[n]\n elif n != len(a):\n a.append(int(a[len(a) - 1] + a[len(a) - 2]))\n else:\n return fibonacci(n)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41995,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:02","func_code":"def index(str, letter, pos):\n if len(str) - 1 == pos:\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12852,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:02","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":10838,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:26","func_code":"def fibonacci(n):\n a = [0, 1]\n if n == len(a):\n return a[n]\n elif n != len(a):\n a.append(int(a[len(a) - 1] + a[len(a) - 2]))\n else:\n return fibonacci(n)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27228,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:26","func_code":"def fibonacci(n):\n a = [0, 1]\n if n == len(a):\n return a[n]\n elif n != len(a):\n a.append(int(a[len(a) - 1] + a[len(a) - 2]))\n else:\n return fibonacci(n)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14652,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:26","func_code":"def index(str, letter, pos):\n if len(str) - 1 == pos:\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7985,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:26","func_code":"def index(str, letter, pos):\n if len(str) - 1 == pos:\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16843,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:26","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":17942,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:26","func_code":"def index(str, letter, pos):\n if len(str) - 1 == pos:\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15936,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:26","func_code":"def fibonacci(n):\n a = [0, 1]\n if n == len(a):\n return a[n]\n elif n != len(a):\n a.append(int(a[len(a) - 1] + a[len(a) - 2]))\n else:\n return fibonacci(n)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7778,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:26","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":41228,"user":"dcc2a3d3-d90d-4640-9797-7d037bff9027","date":"2018-03-18 18:27:26","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":14964,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-19 09:28:09","func_code":"def search(string, letter):\n if string == []:\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":30634,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-19 09:28:30","func_code":"def search(string, letter):\n if string == []:\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":14581,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-19 09:28:58","func_code":"def search(string, letter):\n if string == []:\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":20427,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-19 09:29:58","func_code":"def search(string, letter):\n if string == []:\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":23262,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-19 09:35:04","func_code":"def search(string, letter, pos):\n if pos == len(string):\n return False\n elif string[pos] == letter:\n return True\n else:\n return search(string, letter, pos + 1)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":19698,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-19 09:37:33","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":8931,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-19 09:38:10","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[0:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":16194,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-19 09:39:04","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":5177,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-19 09:39:04","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":16708,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-03-19 09:39:04","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":26422,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:10:52","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":2132,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:10:52","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9958,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:14:58","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14301,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:14:58","func_code":"def fibonacci(n):\n a, b = 0, 1\n while b < n:\n a, b = b, a + b\n return b","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":12336,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:14:58","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":16518,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:19:40","func_code":"def fibonacci(n):\n a, b = 0, 1\n while b < 10:\n a, b = b, a + b\n return b","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5956,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:19:40","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":7357,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:19:40","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16184,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:21:37","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":9200,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:21:37","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while b < n:\n prev_a = a\n a = b\n b = prev_a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8625,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:21:37","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19065,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:22:01","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":39192,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:22:01","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4245,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:22:01","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while b < n:\n prev_a = a\n a = b\n b = prev_a + b\n return b","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20276,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:22:35","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while b < n:\n prev_a = a\n a = b\n b = prev_a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41675,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:22:35","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9524,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:22:35","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":19290,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:22:56","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":36188,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:22:56","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while b <= n:\n prev_a = a\n a = b\n b = prev_a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34409,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:22:56","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11063,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:23:15","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37417,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:23:15","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":26288,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:23:15","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while b <= n:\n prev_a = a\n a = b\n b = prev_a + b\n return b","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15338,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:25:54","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while b <= n:\n prev_a = a\n a = b\n b = prev_a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22346,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:25:54","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37170,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:25:54","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":21551,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:27:00","func_code":"def fibonacci(n):\n a = 1\n b = 1\n while b <= n:\n prev_a = a\n a = b\n b = prev_a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30250,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:27:00","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":19550,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:27:00","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38810,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:27:12","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19556,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:27:12","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":15417,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:27:12","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while b <= n:\n prev_a = a\n a = b\n b = prev_a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38921,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:29:00","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41481,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:29:00","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while b > 0:\n prev_a = a\n a = b\n b = prev_a + b\n n -= 1\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32229,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:29:00","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":5641,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:29:37","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37168,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:29:37","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":1133,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:29:37","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while n > 0:\n prev_a = a\n a = b\n b = prev_a + b\n n -= 1\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":25222,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:41:37","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":34658,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:42:33","func_code":"def search(str, letter):\n if str[-1] != a:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":24483,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:42:55","func_code":"def search(str, letter):\n if str[-1] != letter:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":11747,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:44:07","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":42195,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:53:46","func_code":"def index(str, letter):\n if str[0] == letter:\n return 0\n else:\n return 1 + index(str[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2107,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:53:46","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":34582,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:57:33","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":30712,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:57:33","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str[1:], letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4660,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:58:50","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while n > 0:\n prev_a = a\n a = b\n b = prev_a + b\n n -= 1\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":15430,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:58:50","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":27837,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:58:50","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":11709,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:59:03","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":25259,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:59:03","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str[1:], letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31816,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:59:56","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return 1\n else:\n return index(str[1:], letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7061,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 17:59:56","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":5295,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:00:38","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":23760,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:00:38","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return 0\n else:\n return 1 + index(str[1:], letter, pos)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19399,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:01:18","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28893,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:01:18","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return 0\n else:\n return index(str[1:], letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":506,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:02:34","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return 0\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":25415,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:02:34","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":7399,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:03:07","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":14940,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:03:07","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":8525,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:06:53","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":4027,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:06:53","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":37307,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:06:53","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":12506,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:07:31","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":39814,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:07:31","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":11724,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:07:31","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":143,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:25:05","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21221,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:25:05","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":19504,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:25:05","func_code":"def fibonacci(n):\n a = 0\n b = 0\n while n > 0:\n prev_a = a\n a = b\n b = prev_a + b\n n -= 1\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33935,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:25:34","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":23092,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:25:34","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":16943,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:25:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38130,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:25:34","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while n > 0:\n prev_a = a\n a = b\n b = prev_a + b\n n -= 1\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":40745,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:25:34","func_code":"def fibonacci(n):\n a = 0\n b = 1\n while n > 0:\n prev_a = a\n a = b\n b = prev_a + b\n n -= 1\n return a","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":20229,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:25:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str) and str[i] != letter:\n i = i + 1\n if i < len(str):\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9357,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:31:15","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":7542,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:31:15","func_code":"def fibonacci(n):\n firN = 0\n secN = 1\n while n > 0:\n prev_N = firN\n firN = secN\n secN = prev_N + secN\n n -= 1\n return firN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":42092,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:31:15","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":35743,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:31:15","func_code":"def fibonacci(n):\n firN = 0\n secN = 1\n while n > 0:\n prev_N = firN\n firN = secN\n secN = prev_N + secN\n n -= 1\n return firN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8919,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:31:15","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":22788,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:31:15","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18927,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:40:14","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":33166,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:40:14","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":21440,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:40:14","func_code":"def search(str, letter):\n if str == []:\n return False\n elif lstr[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":34769,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:40:33","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":18627,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:40:33","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":6865,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:40:33","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":32941,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:41:13","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":39943,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:41:13","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":29791,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:41:13","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":5253,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:41:13","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":35933,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:41:13","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":7821,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:41:13","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":37884,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:41:13","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":26416,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:41:13","func_code":"def search(str, letter):\n if len(str) == 0:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":34669,"user":"b588e248-0a0b-40c1-ad90-f9fc1d050dd0","date":"2018-03-19 18:41:13","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":12467,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:50:16","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":1907,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:56:52","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":4053,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 18:56:52","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":38866,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 19:00:17","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":10101,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 19:00:17","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":40845,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 19:00:17","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":36900,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 19:00:17","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":39199,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 19:00:17","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":33267,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 19:00:17","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":28409,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 19:00:17","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":2826,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 19:00:17","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":28070,"user":"639d0a36-d89c-469e-a1ae-4cadc99d8827","date":"2018-03-19 19:00:17","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":28680,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-19 19:23:03","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":22600,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-19 19:23:03","func_code":"def append2list(l1, l2=None):\n if l2 is None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37130,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-19 19:25:05","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":33846,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-03-19 19:25:05","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x2 - x1) ** 2 + (y2 - y1) ** 2 < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":18721,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:26:12","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":19929,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 19:30:39","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":7364,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 19:30:39","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":30356,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 19:30:39","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":10277,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 19:30:39","func_code":"def weird_case(some_str):\n A = ' '\n a = []\n line = some_str.strip('\\n').split(A)\n i = 0\n while i < len(line):\n word = line[i]\n x = 0\n while x < len(word):\n a.append(word[x])\n x = x + 1\n a.append(A)\n i = i + 1\n del a[len(a) - 1]\n x = -1\n i = 0\n while i < len(a):\n if a[i] != A:\n x = x + 1\n if x == 0 or x % 2 == 0:\n a[i] = str(a[i].upper())\n i = i + 1\n return ''.join(a)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25693,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 19:30:39","func_code":"def remove_zeros(a):\n b = []\n i = 0\n while i < len(a):\n if int(a[i]) == 0:\n a.remove(a[i])\n i = i - 1\n i = i + 1","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":29217,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 19:30:39","func_code":"def merge_lists(l1, l2):\n i = 0\n while i < len(l2):\n l1.append(l2[i])\n i = i + 1\n i = 0\n while i < len(l1):\n if i % 2 == 1 and i != 0:\n l1.remove(l1[i])\n i = i + 1\n return l1","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":false} {"submission_id":8976,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:34:04","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":25406,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:34:04","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":41812,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:38:22","func_code":"def fibonacci(n):\n i = 0\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987,\n 1597]\n while i < 10:\n return fib[n]\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35274,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:38:22","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9052,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:38:22","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":23509,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:38:22","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35603,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:38:22","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":39005,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:38:22","func_code":"def fibonacci(n):\n i = 0\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987,\n 1597]\n while i < 10:\n return fib[n]\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29760,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:48:28","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":32814,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:48:28","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39376,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:48:28","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":35413,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:48:28","func_code":"def fibonacci(n):\n i = 0\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987,\n 1597]\n while i < 10:\n return fib[n]\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":12976,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:48:28","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3397,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:48:28","func_code":"def fibonacci(n):\n i = 0\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987,\n 1597]\n while i < 10:\n return fib[n]\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10013,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:48:28","func_code":"def index(str, letter):\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":24068,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:48:28","func_code":"def fibonacci(n):\n i = 0\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987,\n 1597]\n while i < 10:\n return fib[n]\n i = i + 1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39042,"user":"ce889881-69dd-4396-aceb-e6f7dddc2c14","date":"2018-03-19 19:48:28","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":20620,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:19:54","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":8994,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:22:25","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":17797,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:23:37","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":31071,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:24:03","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":25963,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:24:20","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":2688,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:36:25","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":8857,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:36:25","func_code":"def index(str, letter):\n pos_letter = 1\n i = 0\n while i < len(str):\n if letter in str:\n pos_letter = i + 1\n i = i + 1\n return pos_letter\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10349,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:42:54","func_code":"def search(string, letter):\n if string == []:\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":29827,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:42:54","func_code":"def fibonacci(n):\n n1 = 0\n n2 = 1\n count = 0\n while count < n:\n if n == 0:\n print(n1)\n elif n == 1:\n print(n2)\n else:\n print(n1)\n print(n2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":2600,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:42:54","func_code":"def index(string, letter):\n position = 0\n if string == []:\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n index(string[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":22000,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:43:42","func_code":"def index(string, letter):\n position = 0\n if string == []:\n print('-1')\n elif string[0] == letter:\n print(position)\n else:\n position += 1\n index(string[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13310,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:43:42","func_code":"def fibonacci(n):\n n1 = 0\n n2 = 1\n count = 0\n while count < n:\n if n == 0:\n print(n1)\n elif n == 1:\n print(n2)\n else:\n print(n1)\n print(n2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20083,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:43:42","func_code":"def search(string, letter):\n if string == []:\n print('False')\n elif string[0] == letter:\n print('True')\n else:\n search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":24412,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:45:24","func_code":"def index(string, letter):\n position = 0\n if string == []:\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n return index(string[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30962,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:45:24","func_code":"def search(string, letter):\n if string == []:\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":33293,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:45:24","func_code":"def fibonacci(n):\n n1 = 0\n n2 = 1\n count = 0\n while count < n:\n if n == 0:\n print(n1)\n elif n == 1:\n print(n2)\n else:\n print(n1)\n print(n2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40106,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:46:01","func_code":"def index(string, letter):\n position = 0\n if string == ' ':\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n return index(string[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37266,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:46:01","func_code":"def search(string, letter):\n if string == ' ':\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":38788,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:46:01","func_code":"def fibonacci(n):\n n1 = 0\n n2 = 1\n count = 0\n while count < n:\n if n == 0:\n print(n1)\n elif n == 1:\n print(n2)\n else:\n print(n1)\n print(n2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16129,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:46:42","func_code":"def fibonacci(n):\n n1 = 0\n n2 = 1\n count = 0\n while count < n:\n if n == 0:\n print(n1)\n elif n == 1:\n print(n2)\n else:\n print(n1)\n print(n2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17860,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:46:42","func_code":"def index(string, letter):\n position = 0\n if string == '':\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n return index(string[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8061,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:46:42","func_code":"def search(string, letter):\n if string == '':\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":35992,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:48:47","func_code":"def search(string, letter):\n if string == '':\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":9386,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:48:47","func_code":"def fibonacci(n):\n n1 = 0\n n2 = 1\n count = 0\n while count < n:\n if n == 0:\n print(n1)\n elif n == 1:\n print(n2)\n else:\n print(n1)\n print(n2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15254,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:48:47","func_code":"def index(string, letter, position=0):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n return index(string[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38708,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:49:11","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":14318,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:49:11","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return pos_letter","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38956,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:49:20","func_code":"def fibonacci(n):\n n1 = 0\n n2 = 1\n count = 0\n while count < n:\n if n == 0:\n print(n1)\n elif n == 1:\n print(n2)\n else:\n print(n1)\n print(n2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19890,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:49:20","func_code":"def index(string, letter, position):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n return index(string[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32648,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:49:20","func_code":"def search(string, letter):\n if string == '':\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28924,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:49:48","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":27011,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:49:48","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":31081,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:49:51","func_code":"def fibonacci(n):\n n1 = 0\n n2 = 1\n count = 0\n while count < n:\n if n == 0:\n print(n1)\n elif n == 1:\n print(n2)\n else:\n print(n1)\n print(n2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39633,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:49:51","func_code":"def search(string, letter):\n if string == '':\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":19616,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:49:51","func_code":"def index(string, letter, position):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n return index(string[1:], letter, position)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5878,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:53:37","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":3610,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:53:37","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2264,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:54:12","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":49,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:54:12","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":32261,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:54:25","func_code":"def index(string, letter, position):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n return index(string[1:], letter, position)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11879,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:54:25","func_code":"def fibonacci(n):\n time = 0\n if n <= 1:\n return n\n else:\n return fibonnaci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20491,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:54:25","func_code":"def search(string, letter):\n if string == '':\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":41285,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:55:13","func_code":"def index(string, letter, position):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n return index(string[1:], letter, position)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18837,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:55:13","func_code":"def fibonacci(n):\n time = 0\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":27930,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:55:13","func_code":"def search(string, letter):\n if string == '':\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28879,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:55:48","func_code":"def index(string, letter, position):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n return index(string[1:], letter, position)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30199,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:55:48","func_code":"def search(string, letter):\n if string == '':\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":34969,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 20:55:48","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":26036,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:58:07","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":42316,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 20:58:07","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5639,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:01:07","func_code":"def index(str, letter):\n if letter not in str:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7464,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:01:07","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":459,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:01:43","func_code":"def index(str, letter):\n if letter not in str:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38412,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:01:43","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":34055,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:02:43","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":8612,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:02:43","func_code":"def index(str, letter):\n if letter not in str:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":42327,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:03:12","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":20941,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:03:12","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos\n if letter not in str:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16915,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 21:03:55","func_code":"def index(string, letter, position):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n return index(string[1:], letter, position)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39616,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 21:03:55","func_code":"def index(string, letter, position):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return position\n else:\n position += 1\n return index(string[1:], letter, position)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35782,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 21:03:55","func_code":"def search(string, letter):\n if string == '':\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":4128,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 21:03:55","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37986,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 21:03:55","func_code":"def search(string, letter):\n if string == '':\n return 'False'\n elif string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":41598,"user":"e84d5440-bfc2-41cd-a020-f2cd55cb79b4","date":"2018-03-19 21:03:55","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":1564,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:04:22","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":7550,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:04:22","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos\n if letter not in str:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31240,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:06:38","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":16788,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:06:38","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":700,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:07:02","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos\n print('-1')","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35898,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:07:02","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":23397,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:10:14","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":35317,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:10:14","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n if letter in str:\n letter_pos = i + 1\n return letter_pos\n else:\n print('-1')","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32419,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:11:38","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":34308,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:11:38","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n return letter_pos\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7556,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:12:22","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20123,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:12:22","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":5246,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:22:03","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23512,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:22:03","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":31486,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:22:03","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18616,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:23:16","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":26368,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:23:16","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13084,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:23:16","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28381,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:24:11","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n else:\n return '-1'\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30314,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:24:11","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30425,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:24:11","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":24760,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:24:59","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":29122,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:24:59","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18659,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:24:59","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12078,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:33:43","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":39554,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:33:43","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35130,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:33:43","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28770,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:34:36","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":19243,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:34:36","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11655,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:34:36","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17534,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 21:38:35","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36996,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 21:38:35","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i = i + 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":28507,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 21:38:35","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23912,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 21:38:35","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4772,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 21:38:35","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":38527,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 21:38:35","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":10399,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 21:38:35","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i = i + 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":697,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 21:38:35","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":27037,"user":"161bb8fd-c916-4d4e-a439-1dce6fc8f542","date":"2018-03-19 21:38:35","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i = i + 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":38634,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:46:05","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32725,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:46:05","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37392,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:46:05","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":23429,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:46:05","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22043,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:46:05","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":1287,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-19 21:46:05","func_code":"def index(str, letter):\n i = str[0]\n letter_pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4190,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:14:20","func_code":"def search(ls, val):\n if val in ls:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":1800,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:15:36","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i += 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":6656,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:15:36","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36880,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:15:36","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":33963,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:15:36","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i += 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":34283,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:15:36","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i += 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18427,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:15:36","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i += 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28729,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:16:09","func_code":"def search(ls, val):\n if val in ls:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":21288,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:25:21","func_code":"def index(string, letter):\n pos = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n pos = i\n i = i + 1\n return pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28360,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:25:21","func_code":"def search(ls, val):\n if val in ls:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":27432,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:29:36","func_code":"def search(ls, val):\n if val in ls:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":13435,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:29:36","func_code":"def index(string, letter):\n pos = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n pos = i\n i = i + 1\n return pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3228,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:31:02","func_code":"def search(ls, val):\n if val in ls:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":22918,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:31:02","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29680,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:31:02","func_code":"def index(string, letter):\n pos = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n pos = i\n i = i + 1\n return pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18371,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:31:16","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17295,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:31:16","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":13661,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:31:16","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39801,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:31:40","func_code":"def search(ls, val):\n if val in ls:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":34062,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:31:40","func_code":"def search(ls, val):\n if val in ls:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":14232,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:31:40","func_code":"def index(string, letter):\n pos = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n pos = i\n i = i + 1\n return pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":406,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:31:40","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35290,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:31:40","func_code":"def index(string, letter):\n pos = -1\n i = 0\n while i < len(string):\n if string[i] == letter:\n pos = i\n i = i + 1\n return pos","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":34814,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 22:31:40","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41430,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:31:43","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":7545,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:31:43","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":144,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:31:43","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22679,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:32:03","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20068,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:32:03","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":17598,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:32:03","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10719,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:32:21","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":2465,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:32:21","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32307,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:32:21","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":40073,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:32:49","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37964,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:32:49","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":1552,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:32:49","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20928,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:33:22","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3738,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:33:22","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16766,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:33:22","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":15854,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:34:56","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33102,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:34:56","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":2461,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:34:56","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":22996,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:35:19","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20628,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:35:19","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41082,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:35:19","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":15662,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:36:11","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":33673,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:36:11","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5987,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:36:11","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39925,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:36:41","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14589,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:36:41","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":27995,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:36:41","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19235,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:37:06","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":29115,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:37:06","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27284,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:37:06","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19974,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:37:16","func_code":"def index(string, letter, pos=0):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return pos\n else:\n pos += 1\n return index(string[1:], letter, pos=pos)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13347,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:37:16","func_code":"def search(string, letter):\n if string == '':\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":25929,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:37:16","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n == 2:\n return 1\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":1176,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:37:16","func_code":"def search(string, letter):\n if string == '':\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":15921,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:37:16","func_code":"def search(string, letter):\n if string == '':\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":42470,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:37:16","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n == 2:\n return 1\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":21891,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:37:16","func_code":"def index(string, letter, pos=0):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return pos\n else:\n pos += 1\n return index(string[1:], letter, pos=pos)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5477,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:37:16","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n == 2:\n return 1\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":41164,"user":"b307bc6a-3e47-4e87-960f-7f47db5cc8d8","date":"2018-03-19 22:37:16","func_code":"def index(string, letter, pos=0):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return pos\n else:\n pos += 1\n return index(string[1:], letter, pos=pos)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11754,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:37:40","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":13840,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:37:40","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16149,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:37:40","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32871,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:44:13","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13643,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:44:13","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35672,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:44:13","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":37589,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:44:21","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":37709,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:44:21","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19845,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:44:33","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36200,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:44:33","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28179,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:44:33","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15112,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:45:06","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18502,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:45:06","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13671,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:46:00","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":7273,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:46:00","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17520,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:46:37","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34086,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:46:37","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":3425,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:47:18","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":24826,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:47:18","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26585,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:47:18","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":1777,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:48:17","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30920,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:48:17","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":38057,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:48:17","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30519,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:48:17","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41666,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:48:17","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":24732,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-03-19 22:48:17","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":4703,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:48:18","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4468,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:48:18","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":4264,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:48:18","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14016,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:48:45","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":10057,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:48:45","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26207,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:48:45","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":4766,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:50:04","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":28056,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:50:04","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23220,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:50:04","func_code":"def index(str, letter):\n if letter in str:\n return str\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12339,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:50:29","func_code":"def index(str, letter):\n if letter in str:\n return letter\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":34394,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:50:29","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20242,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:50:29","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":40457,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:50:34","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28390,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:50:34","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39661,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:50:34","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":25287,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:51:06","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38512,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:51:06","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16561,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:51:06","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":31801,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:51:06","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30548,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:51:06","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33659,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 22:51:06","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":25349,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 22:51:07","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":18045,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 22:51:07","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n index = letter.index('str')\n if str[i] == letter:\n return index\n else:\n return '-1'\n i = i + 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3231,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 22:51:07","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6467,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:53:49","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37148,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:53:49","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1641,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:53:49","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":38891,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-19 22:54:18","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14926,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-19 22:54:18","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":9492,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-19 22:54:18","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":24115,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-19 22:54:18","func_code":"def fibonacci(num):\n l = [0]\n i = 0\n while num >= len(l):\n if len(l) > 1:\n num2 = l[i] + l[i - 1]\n else:\n num2 = l[i] + 1\n l.append(num2)\n i = i + 1\n return l[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":24261,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-19 22:54:18","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19099,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-19 22:54:18","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":25389,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-19 22:54:18","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":28156,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-19 22:54:18","func_code":"def fibonacci(num):\n l = [0]\n i = 0\n while num >= len(l):\n if len(l) > 1:\n num2 = l[i] + l[i - 1]\n else:\n num2 = l[i] + 1\n l.append(num2)\n i = i + 1\n return l[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":1838,"user":"d2330156-60dd-4aca-a925-9aa27e3edb48","date":"2018-03-19 22:54:18","func_code":"def fibonacci(num):\n l = [0]\n i = 0\n while num >= len(l):\n if len(l) > 1:\n num2 = l[i] + l[i - 1]\n else:\n num2 = l[i] + 1\n l.append(num2)\n i = i + 1\n return l[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":13604,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:55:00","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26392,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:55:00","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":17315,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:55:00","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35258,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:58:00","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":5121,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:58:00","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21425,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:58:00","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32561,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:58:44","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21584,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:58:44","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":37518,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:58:44","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":34739,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:59:07","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29627,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:59:07","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":27116,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 22:59:07","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12569,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:02:00","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":41704,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:02:00","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return str[i]\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":33817,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:02:00","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":336,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:03:10","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9379,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:03:10","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":39179,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:03:10","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return str[i]\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13091,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:03:27","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":18494,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:03:27","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter in str[i]:\n return str[i]\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6953,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:03:27","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35017,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:03:56","func_code":"def fibonacci(n):\n first = 0\n second = 0\n while 0 < n:\n last = first\n first = second\n second = last + second\n n = n - 1\n return first","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13845,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:03:56","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":14338,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:03:56","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8099,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:04:39","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":14638,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:04:39","func_code":"def fibonacci(n):\n first = 0\n second = 1\n while 0 < n:\n last = first\n first = second\n second = last + second\n n = n - 1\n return first","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":16543,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:04:39","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10070,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:05:58","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17576,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:05:58","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":7956,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:05:58","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19442,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:05:58","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29114,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:05:58","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26844,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:05:58","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":10293,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 23:09:30","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":32018,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 23:09:30","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":36418,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 23:09:30","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":29008,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 23:09:30","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":4115,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 23:09:30","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":25936,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 23:09:30","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38421,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 23:09:30","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":27332,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 23:09:30","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26126,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-19 23:09:30","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":912,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:10:30","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12767,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:10:30","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":32262,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:10:30","func_code":"def fibonacci(n):\n first = 0\n second = 1\n while 0 < n:\n last = first\n first = second\n second = last + second\n n = n - 1\n return first","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":23245,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:10:30","func_code":"def fibonacci(n):\n first = 0\n second = 1\n while 0 < n:\n last = first\n first = second\n second = last + second\n n = n - 1\n return first","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":18453,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:10:30","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16195,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:10:30","func_code":"def search(ls, val):\n i = 0\n while i < len(ls):\n if ls[i] == val:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":34689,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:11:07","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":18517,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:11:07","func_code":"def index(str, letter, i):\n if i == len(str):\n return -1\n elif str[i] == letter:\n return i\n else:\n return index(str, letter, i + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":11977,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:11:07","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28730,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:12:24","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":30877,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:12:24","func_code":"def search(ls, val):\n if ls == '':\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":24027,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:12:24","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":29714,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:12:24","func_code":"def index(str, letter, i):\n if i == len(str):\n return -1\n elif str[i] == letter:\n return i\n else:\n return index(str, letter, i + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":33531,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:12:24","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":5723,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:12:24","func_code":"def search(ls, val):\n if ls == '':\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":29192,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:12:24","func_code":"def index(str, letter, i):\n if i == len(str):\n return -1\n elif str[i] == letter:\n return i\n else:\n return index(str, letter, i + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":1305,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:12:24","func_code":"def search(ls, val):\n if ls == '':\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":8325,"user":"f1f904a5-bcf8-461e-8792-f0a8d0db3f47","date":"2018-03-19 23:12:24","func_code":"def index(str, letter, i):\n if i == len(str):\n return -1\n elif str[i] == letter:\n return i\n else:\n return index(str, letter, i + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":37841,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:15:58","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15761,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:15:58","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":26811,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:15:58","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":22427,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:17:25","func_code":"def index(string, letter, rv):\n if string == []:\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(sring[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13970,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:17:25","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":38160,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:18:29","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":13777,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:18:29","func_code":"def index(string, letter, rv):\n if string == []:\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(sring[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2558,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:19:16","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":15445,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:19:16","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14385,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:19:16","func_code":"def index(string, letter, rv):\n if string == []:\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(sring[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16607,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:19:55","func_code":"def index(string, letter, rv):\n if string == []:\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(sring[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10170,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:19:55","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39761,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:19:55","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":17916,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:21:45","func_code":"def index(string, letter, rv):\n if string == []:\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16864,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:21:45","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29710,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:21:45","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":30290,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:22:18","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":36583,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:22:18","func_code":"def index(str, letter, pos):\n if str[pos] == letter:\n return str[pos]\n elif str[pos] != letter:\n return '-1'\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37566,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:22:18","func_code":"def index(str, letter, pos):\n if str[pos] == letter:\n return str[pos]\n elif str[pos] != letter:\n return '-1'\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6905,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:22:18","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":35943,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:22:18","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":9608,"user":"2a1a0a7b-975b-4463-96bb-4f52900ce463","date":"2018-03-19 23:22:18","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":24041,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:24:00","func_code":"def index(string, letter, rv):\n if string == []:\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2193,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:24:00","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return n\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39959,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:24:00","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":10510,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:24:21","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return n\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13606,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:24:21","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":31390,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:24:21","func_code":"def index(string, letter, rv):\n if string == []:\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13480,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:24:42","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":3786,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:24:42","func_code":"def index(string, letter, rv):\n if string == []:\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4757,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:24:42","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27019,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:26:10","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30346,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:26:10","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":18533,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:26:10","func_code":"def index(string, letter, rv):\n if string == []:\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31635,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:27:14","func_code":"def search(ls, val):\n if ls == []:\n return 'False'\n elif ls[0] == val:\n return 'True'\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":5338,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:27:14","func_code":"def index(string, letter, rv):\n if string == []:\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20516,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:27:14","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10032,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:28:09","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20814,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:28:09","func_code":"def search(ls, val):\n if ls == '':\n return 'False'\n elif ls[0] == val:\n return 'True'\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":24962,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:28:09","func_code":"def index(string, letter, rv):\n if string == []:\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3881,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:28:41","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30652,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:28:41","func_code":"def index(string, letter, rv):\n if string == '':\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":21770,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:28:41","func_code":"def search(ls, val):\n if ls == '':\n return 'False'\n elif ls[0] == val:\n return 'True'\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28573,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:29:12","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return n\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38985,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:29:12","func_code":"def search(ls, val):\n if ls == '':\n return 'False'\n elif ls[0] == val:\n return 'True'\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":6823,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:29:12","func_code":"def index(string, letter, rv):\n if string == '':\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":26226,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:29:51","func_code":"def fibonacci(n):\n if n == 1 or n == 2:\n return n\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27566,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:29:51","func_code":"def index(string, letter, rv):\n if string == '':\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":38812,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:29:51","func_code":"def search(ls, val):\n if ls == '':\n return 'False'\n elif ls[0] == val:\n return 'True'\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":42164,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:34:46","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":16782,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:34:46","func_code":"def index(string, letter, rv):\n if string == '':\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":34295,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:34:46","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":42183,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:34:46","func_code":"def search(ls, val):\n if ls == '':\n return 'False'\n elif ls[0] == val:\n return 'True'\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":4949,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:34:46","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":6011,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:34:46","func_code":"def search(ls, val):\n if ls == '':\n return 'False'\n elif ls[0] == val:\n return 'True'\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":40706,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:34:46","func_code":"def index(string, letter, rv):\n if string == '':\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":38588,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:34:46","func_code":"def index(string, letter, rv):\n if string == '':\n return -1\n elif string[0] == letter:\n return rv\n else:\n rv = rv + 1\n return index(string[1:], letter, rv)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":27958,"user":"db184e8e-e02b-4772-b74b-547b88d21933","date":"2018-03-19 23:34:46","func_code":"def search(ls, val):\n if ls == '':\n return 'False'\n elif ls[0] == val:\n return 'True'\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":40995,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:47:58","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i = i + 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":5075,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:47:58","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n if letter not in string:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18537,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:47:58","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30286,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:03","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i = i + 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":20787,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:03","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13079,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:03","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n if letter not in string:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":11527,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:34","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n if letter not in string:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":6766,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:34","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i = i + 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":14543,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:34","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":213,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:34","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n if letter not in string:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":40381,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:34","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5918,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:34","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n if letter not in string:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":14866,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:34","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i = i + 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":18920,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:34","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9844,"user":"9cf41e84-15c1-4c2d-90e2-497206e45e8b","date":"2018-03-20 00:49:34","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i = i + 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":13454,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:05:40","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":38646,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:05:40","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16081,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:05:40","func_code":"def fibonacci(n):\n firN = 0\n secN = 1\n while n > 0:\n prev_N = firN\n firN = secN\n sec_N = prev_N + secN\n n -= 1\n return firN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":31165,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:14:28","func_code":"def fibonacci(n):\n firN = 0\n secN = 1\n while n > 0:\n prev_N = firN\n firN = secN\n sec_N = prev_N + secN\n n -= 1\n return firN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1240,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:14:28","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7651,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:14:28","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":31743,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:21:11","func_code":"def search(s, l, i=0):\n A = False\n if i < len(s):\n if s[i] == l:\n contains = True\n return contains\n else:\n contains = A\n return search(s, l, i + 1)\n else:\n return A","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":35732,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:21:11","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1 or n == 2:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":270,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:21:11","func_code":"def index(s, l, i=0):\n if i < len(s):\n if s[i] == l:\n contains = i\n return contains\n else:\n contains = -1\n return index(s, l, i + 1)\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":6451,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:22:24","func_code":"def search(s, l, i=0):\n A = False\n if i < len(s):\n if s[i] == l:\n contains = True\n return contains\n else:\n contains = A\n return search(s, l, i + 1)\n else:\n return A","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":14976,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:22:24","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1 or n == 2:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":15190,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:22:24","func_code":"def index(s, l, i=0):\n if i < len(s):\n if s[i] == l:\n contains = i\n return contains\n else:\n contains = -1\n return index(s, l, i + 1)\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":10387,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:22","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1 or n == 2:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37680,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:22","func_code":"def index(s, l, i=0):\n if i < len(s):\n if s[i] == l:\n contains = i\n return contains\n else:\n contains = -1\n return index(s, l, i + 1)\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":20219,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:22","func_code":"def search(s, l, i=0):\n A = False\n if i < len(s):\n if s[i] == l:\n contains = True\n return contains\n else:\n contains = A\n return search(s, l, i + 1)\n else:\n return A","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":35687,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:56","func_code":"def search(s, l, i=0):\n A = False\n if i < len(s):\n if s[i] == l:\n contains = True\n return contains\n else:\n contains = A\n return search(s, l, i + 1)\n else:\n return A","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":12349,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:56","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1 or n == 2:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":12150,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:56","func_code":"def index(s, l, i=0):\n if i < len(s):\n if s[i] == l:\n contains = i\n return contains\n else:\n contains = -1\n return index(s, l, i + 1)\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":25719,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:56","func_code":"def search(s, l, i=0):\n A = False\n if i < len(s):\n if s[i] == l:\n contains = True\n return contains\n else:\n contains = A\n return search(s, l, i + 1)\n else:\n return A","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":31576,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:56","func_code":"def index(s, l, i=0):\n if i < len(s):\n if s[i] == l:\n contains = i\n return contains\n else:\n contains = -1\n return index(s, l, i + 1)\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":27373,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:56","func_code":"def search(s, l, i=0):\n A = False\n if i < len(s):\n if s[i] == l:\n contains = True\n return contains\n else:\n contains = A\n return search(s, l, i + 1)\n else:\n return A","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":19653,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:56","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1 or n == 2:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":35719,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:56","func_code":"def index(s, l, i=0):\n if i < len(s):\n if s[i] == l:\n contains = i\n return contains\n else:\n contains = -1\n return index(s, l, i + 1)\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":3106,"user":"03141ef3-f364-4b7c-9f52-990a173ac162","date":"2018-03-20 01:24:56","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1 or n == 2:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":19434,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:36:41","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":11818,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:36:41","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":37469,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:36:41","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":5194,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:36:41","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":832,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:36:41","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":11896,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:36:41","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":19959,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:37:48","func_code":"def fibonacci(n):\n firN = 0\n secN = 1\n while n > 0:\n prev_N = firN\n firN = secN\n sec_N = prev_N + secN\n n -= 1\n return firN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21805,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:37:48","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15695,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:37:48","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":21499,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:49:56","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":8385,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:49:56","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9432,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:49:56","func_code":"def fibonacci(n):\n firN = 0\n secN = 1\n while n > 0:\n prev_N = firN\n firN = secN\n sec_N = prev_N + secN\n n -= 1\n return firN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21244,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:51:54","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35460,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:51:54","func_code":"def fibonacci(n):\n firN = 0\n secN = 1\n while n > 0:\n prev_N = firN\n firN = secN\n sec_N = prev_N + secN\n n -= 1\n return firN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6724,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:51:54","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":27298,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:51:54","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13879,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:51:54","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":16423,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:51:54","func_code":"def fibonacci(n):\n firN = 0\n secN = 1\n while n > 0:\n prev_N = firN\n firN = secN\n sec_N = prev_N + secN\n n -= 1\n return firN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":64,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:51:54","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14998,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:51:54","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":33637,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-20 01:51:54","func_code":"def fibonacci(n):\n firN = 0\n secN = 1\n while n > 0:\n prev_N = firN\n firN = secN\n sec_N = prev_N + secN\n n -= 1\n return firN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41872,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:19:13","func_code":"def fibonacci(n):\n values = [0, 1]\n i = 2\n while i <= n:\n terms.append(values[i - 1] + values[i - 2])\n i = i + 1\n return values[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32733,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:19:13","func_code":"def search(str, letter):\n if letter not in str:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":26173,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:19:13","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n count = 0\n while str[count] != letter:\n count += 1\n return count","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":41121,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:19:59","func_code":"def fibonacci(n):\n values = [0, 1]\n i = 2\n while i <= n:\n values.append(values[i - 1] + values[i - 2])\n i = i + 1\n return values[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":18010,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:19:59","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n count = 0\n while str[count] != letter:\n count += 1\n return count","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":14436,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:19:59","func_code":"def search(str, letter):\n if letter not in str:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":38396,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:30:44","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n count = 0\n while str[count] != letter:\n count += 1\n return count","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28133,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:30:44","func_code":"def fibonacci(n):\n values = [0, 1]\n i = 2\n while i <= n:\n values.append(values[i - 1] + values[i - 2])\n i = i + 1\n return values[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":21976,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:30:44","func_code":"def search(str, letter):\n if letter not in str:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":1906,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:33:30","func_code":"def index(str, letter, default=0):\n while default == 0:\n if letter not in str:\n return -1\n else:\n count = 0\n while str[count] != letter:\n count += 1\n return count","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13600,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:33:30","func_code":"def fibonacci(n):\n values = [0, 1]\n i = 2\n while i <= n:\n values.append(values[i - 1] + values[i - 2])\n i = i + 1\n return values[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":40053,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:33:30","func_code":"def search(str, letter):\n if letter not in str:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":38541,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:34:09","func_code":"def search(str, letter):\n if letter not in str:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":2760,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:34:09","func_code":"def index(str, letter, default=0):\n if default == 0:\n if letter not in str:\n return -1\n else:\n count = 0\n while str[count] != letter:\n count += 1\n return count","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":29732,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:34:09","func_code":"def fibonacci(n):\n values = [0, 1]\n i = 2\n while i <= n:\n values.append(values[i - 1] + values[i - 2])\n i = i + 1\n return values[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":29823,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:34:09","func_code":"def fibonacci(n):\n values = [0, 1]\n i = 2\n while i <= n:\n values.append(values[i - 1] + values[i - 2])\n i = i + 1\n return values[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":12669,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:34:09","func_code":"def search(str, letter):\n if letter not in str:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":7524,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 07:34:09","func_code":"def index(str, letter, default=0):\n if default == 0:\n if letter not in str:\n return -1\n else:\n count = 0\n while str[count] != letter:\n count += 1\n return count","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":18302,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:06:12","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":41002,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:06:29","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n < len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8767,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:06:29","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n if string == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26621,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:06:29","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18254,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:07:07","func_code":"def index(str, letter):\n if letter in str:\n print(1)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8517,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:07:07","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":37079,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:19","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n < len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7241,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:19","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n if string == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39760,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:19","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":27573,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:43","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":24942,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:43","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35439,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:43","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":9583,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:43","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":40506,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:43","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":31945,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:43","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":13584,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:43","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12836,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:43","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":2940,"user":"fd20892b-e35f-43bc-b82d-e6db9320b8ae","date":"2018-03-20 10:07:43","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":5215,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2018-03-20 10:10:14","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":11582,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2018-03-20 10:10:14","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29843,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2018-03-20 10:10:14","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41249,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2018-03-20 10:10:14","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2417,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2018-03-20 10:10:14","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":19787,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2018-03-20 10:10:14","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":2809,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2018-03-20 10:10:14","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":32020,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2018-03-20 10:10:14","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":19318,"user":"424d327d-5f5b-4330-a365-eccda358dbd5","date":"2018-03-20 10:10:14","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":12043,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:20:59","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":42017,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:20:59","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":9924,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:20:59","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":19239,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:20:59","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":8935,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:20:59","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":29402,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:20:59","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36454,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:24:27","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":17827,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:27:48","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":21815,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:27:48","func_code":"def index(str, letter, i):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18653,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:27:48","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":17317,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:28:40","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":35688,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:28:40","func_code":"def index(str, letter, i):\n if letter in str[i]:\n return i\n else:\n return '1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12993,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:28:40","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37027,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:28:42","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":16250,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:28:42","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21802,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:28:42","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":11164,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:28:44","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":9158,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:28:44","func_code":"def index(str, letter):\n pos = 0\n if pos == len(str):\n return '-1'\n elif str[pos] == letter:\n return True\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":42033,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:28:54","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":19079,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:28:54","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":21879,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:28:54","func_code":"def index(str, letter, i):\n if letter in str[i]:\n return i\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37694,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:29:04","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":22359,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:29:04","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":40983,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:29:04","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15563,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:30:17","func_code":"def index(str, letter):\n pos = 0\n if pos == len(str):\n return '-1'\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28619,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:30:17","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":8198,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:31:04","func_code":"def fibonacci(n):\n a, b = 0, 1\n for num in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1541,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:31:23","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":12230,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:31:23","func_code":"def index(str, letter):\n position = 0\n if position == len(str):\n return '-1'\n elif str[position] == letter:\n return pos\n else:\n return index(str, letter, position + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":40573,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:31:50","func_code":"def fibonacci(n):\n a, b = 0, 1\n for num in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5081,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:31:53","func_code":"def index(str, letter, position):\n if position == len(str):\n return '-1'\n elif str[position] == letter:\n return pos\n else:\n return index(str, letter, position + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3162,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:31:53","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":26549,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:32:14","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":40867,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:32:14","func_code":"def index(str, letter, position):\n if position == len(str):\n return '-1'\n elif str[position] == letter:\n return position\n else:\n return index(str, letter, position + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7960,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:33:39","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":32389,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:33:39","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":3643,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:33:39","func_code":"def index(str, letter, i):\n if letter in str[i]:\n return i\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35694,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:35:59","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":5703,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:35:59","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23267,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:35:59","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":7458,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:36:31","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":14418,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:36:31","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7090,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:36:31","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":6198,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:36:49","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":2704,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:36:49","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29633,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:36:49","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":14907,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:36:58","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11190,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:36:58","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30460,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:36:58","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31959,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:36:58","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":33075,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:36:58","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6714,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:36:58","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":35670,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:37:08","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23497,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:37:08","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":2833,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:37:08","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":40575,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2018-03-20 10:37:20","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36836,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2018-03-20 10:37:20","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6991,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:37:41","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28280,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:37:41","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":21545,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:37:41","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":42023,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:38:07","func_code":"def search(string, letter):\n if string[0] == letter:\n return 'True'\n else:\n return 'False'\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":25064,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:38:37","func_code":"def search(string, letter):\n if string[0] == letter:\n return 'True'\n else:\n return 'False'\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":16415,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:38:55","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":31645,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:38:55","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":5176,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:38:55","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":4428,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:39:07","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":12604,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:39:07","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":8751,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:39:07","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3135,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:39:41","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34830,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:39:41","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":3537,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:39:41","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":25382,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:39:41","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":36499,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:39:41","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35011,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:39:41","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20065,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:39:41","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":19466,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:39:41","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":8859,"user":"762404df-24ca-44ff-9c98-3f841fa7faab","date":"2018-03-20 10:39:41","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":14774,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:39:52","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8324,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:39:52","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23030,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:39:52","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":26974,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 10:39:55","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i += 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":15539,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 10:39:55","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n count = 0\n while str[count] != letter:\n count += 1\n return count","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":14176,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 10:39:55","func_code":"def fibonacci(n):\n values = [0, 1]\n i = 2\n while i <= n:\n values.append(values[i - 1] + values[i - 2])\n i = i + 1\n return values[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":14076,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 10:39:55","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n count = 0\n while str[count] != letter:\n count += 1\n return count","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":15602,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 10:39:55","func_code":"def fibonacci(n):\n values = [0, 1]\n i = 2\n while i <= n:\n values.append(values[i - 1] + values[i - 2])\n i = i + 1\n return values[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":4480,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 10:39:55","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i += 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":25345,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 10:39:55","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i += 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":30171,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 10:39:55","func_code":"def fibonacci(n):\n values = [0, 1]\n i = 2\n while i <= n:\n values.append(values[i - 1] + values[i - 2])\n i = i + 1\n return values[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":38905,"user":"058b18f6-cf34-4afc-8b4e-0f7705be27f0","date":"2018-03-20 10:39:55","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n count = 0\n while str[count] != letter:\n count += 1\n return count","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":37789,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:40:09","func_code":"def search(string, letter):\n if string[0] == letter:\n return 'True'\n else:\n return 'False'\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":32266,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:40:54","func_code":"def search(string, letter):\n if string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":20135,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2018-03-20 10:41:22","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":34473,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2018-03-20 10:41:22","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35826,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2018-03-20 10:41:22","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":33400,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2018-03-20 10:41:22","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":6837,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2018-03-20 10:41:22","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":37532,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2018-03-20 10:41:22","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":36016,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2018-03-20 10:41:22","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":9668,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2018-03-20 10:41:22","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":10153,"user":"ea7c3666-b2a8-45fc-9644-69fa2415de49","date":"2018-03-20 10:41:22","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":25735,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:41:59","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":2280,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:42:11","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":27790,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:42:11","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":26872,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:42:11","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28856,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:42:19","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":3723,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:42:19","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":39398,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:42:19","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":21602,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:42:19","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":36131,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:42:19","func_code":"def index(str, letter, position):\n if position == len(str):\n return '-1'\n elif str[position] == letter:\n return position\n else:\n return index(str, letter, position + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18803,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:42:19","func_code":"def index(str, letter, position):\n if position == len(str):\n return '-1'\n elif str[position] == letter:\n return position\n else:\n return index(str, letter, position + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28713,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:42:23","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":27693,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:42:23","func_code":"def index(str, letter, occurence):\n if occurence == len(str):\n return -1\n elif str[occurence] == letter:\n return occurence\n else:\n return index(str, letter, occurence + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":7541,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:42:23","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":24031,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:42:23","func_code":"def index(str, letter, occurence):\n if occurence == len(str):\n return -1\n elif str[occurence] == letter:\n return occurence\n else:\n return index(str, letter, occurence + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":34151,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:42:23","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n return fibonacci(n - 1) + fibonacci(n - 2)\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":27766,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:42:23","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":12441,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:42:23","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":39253,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:42:23","func_code":"def index(str, letter, occurence):\n if occurence == len(str):\n return -1\n elif str[occurence] == letter:\n return occurence\n else:\n return index(str, letter, occurence + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":2374,"user":"9413c2ae-94cc-4b45-8180-0919de97fe15","date":"2018-03-20 10:42:23","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":41527,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:42:53","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":32965,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:42:53","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":29220,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:42:53","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23147,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:43:04","func_code":"def index(string, letter):\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23027,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:43:04","func_code":"def search(string, letter):\n if string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)\n if letter not in string:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":18746,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:43:21","func_code":"def index(string, letter):\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":36507,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:43:21","func_code":"def search(string, letter):\n if string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)\n if letter not in string:\n print('False')","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":4372,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-20 10:43:21","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":17507,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:44:39","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37083,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:44:39","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":3540,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:44:39","func_code":"def index(str, recursive, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32530,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2018-03-20 10:45:08","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10084,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2018-03-20 10:45:08","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":34921,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2018-03-20 10:45:08","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":30581,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2018-03-20 10:45:08","func_code":"def index(string, letter):\n i = 0\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n i = i + 1\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":36862,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2018-03-20 10:45:08","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":4016,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2018-03-20 10:45:08","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":5250,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2018-03-20 10:45:08","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":2973,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2018-03-20 10:45:08","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":39257,"user":"9c13ddb1-6d39-4008-85d0-50d504649bb6","date":"2018-03-20 10:45:08","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new = list[i] + list[i - 1]\n else:\n new = list[i] + 1\n list.append(new)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":38288,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:45:10","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":26438,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:45:10","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37770,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:45:10","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":30226,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:45:14","func_code":"def search(string, letter):\n if string[0] == letter:\n return 'True'\n else:\n print('False')\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":2523,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:45:14","func_code":"def index(string, letter):\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":537,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-20 10:45:30","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":38223,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-20 10:45:30","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":35601,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:45:36","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8735,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:45:36","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28014,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:45:39","func_code":"def search(string, letter):\n if string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)\n print('False')","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":9107,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:45:39","func_code":"def index(string, letter):\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30582,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:45:52","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":39545,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:45:52","func_code":"def index(str, letter1, letter2):\n i = 0\n while i < len(str):\n if str[i] == letter1:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":25847,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:45:52","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":42116,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:45:52","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'\n i = 0\n while i < len(str):\n if str[i] == letter2:\n return i\n i += 1\n return '-1'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":6608,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:45:52","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'\n i = 0\n while i < len(str):\n if str[i] == letter2:\n return i\n i += 1\n return '-1'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":10021,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:45:52","func_code":"def index(str, letter1, letter2):\n i = 0\n while i < len(str):\n if str[i] == letter1:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32789,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:45:52","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":25612,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:45:52","func_code":"def index(str, letter1, letter2):\n i = 0\n while i < len(str):\n if str[i] == letter1:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13524,"user":"54e3b0c4-223a-427c-9155-d6954330319d","date":"2018-03-20 10:45:52","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'\n i = 0\n while i < len(str):\n if str[i] == letter2:\n return i\n i += 1\n return '-1'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":3399,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:46:20","func_code":"def index(string, letter):\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":29818,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:46:20","func_code":"def search(string, letter):\n if string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)\n print('False')","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":23860,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:46:20","func_code":"def index(string, letter):\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":1794,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:46:20","func_code":"def index(string, letter):\n a = []\n while i < len(string):\n a.append(string[i])\n if string[i] == letter:\n return i\n if letter not in a:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16396,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:46:20","func_code":"def search(string, letter):\n if string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)\n print('False')","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":437,"user":"2a5e3eed-41c7-46e6-9bee-3acc21c1f81b","date":"2018-03-20 10:46:20","func_code":"def search(string, letter):\n if string[0] == letter:\n return 'True'\n else:\n return search(string[1:], letter)\n print('False')","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":37504,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:46:33","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":24771,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:46:33","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":22419,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:46:33","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38808,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-20 10:47:07","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":20072,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-20 10:47:07","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9868,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-20 10:47:07","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28192,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-20 10:47:07","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":9714,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-20 10:47:07","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":29575,"user":"12d00542-0a26-4a35-a142-ccd508484c14","date":"2018-03-20 10:47:07","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i = i + 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":10753,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:48:20","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":2208,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:48:20","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":36963,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:48:51","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":39623,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:48:51","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":11234,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:48:56","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n position = 0\n if letter in str:\n position += 1\n return position\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39180,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:48:56","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n position = 0\n if letter in str:\n position += 1\n return position\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16894,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:48:56","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n number = 0\n first_num = 1\n second_num = 2\n for n in range(3, n):\n number = first_num * second_num\n first_num = second_num\n second_num = number\n return number\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13787,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:48:56","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n number = 0\n first_num = 1\n second_num = 2\n for n in range(3, n):\n number = first_num * second_num\n first_num = second_num\n second_num = number\n return number\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25365,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:48:56","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18580,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:48:56","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n > 1:\n number = 0\n first_num = 1\n second_num = 2\n for n in range(3, n):\n number = first_num * second_num\n first_num = second_num\n second_num = number\n return number\n else:\n return -1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11490,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:48:56","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":26764,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:48:56","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":39950,"user":"6618fe7e-6fd3-499b-a742-8d68ec712ad3","date":"2018-03-20 10:48:56","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n position = 0\n if letter in str:\n position += 1\n return position\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9097,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:49:02","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":36817,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:49:02","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":6923,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:49:02","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":1634,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:49:02","func_code":"def index(str, recursive, letter):\n if letter in str:\n return 1\n elif letter in str:\n return -1\n elif recursive in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20069,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:49:02","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":13851,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:49:02","func_code":"def index(str, recursive, letter):\n if letter in str:\n return 1\n elif letter in str:\n return -1\n elif recursive in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28174,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:50:00","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":3966,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:50:00","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":29426,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:52:24","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":6517,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:52:24","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":10427,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:52:46","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":10207,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:52:46","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":36098,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:53:36","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20180,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:53:36","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35833,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-20 10:53:36","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 1\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 1\n return l3[::2]","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":12914,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 10:56:50","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":20408,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:58:28","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":41439,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:58:28","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":28010,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:58:28","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'\n\n\ndef fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38513,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 10:59:13","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":5235,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 10:59:13","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2148,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:59:18","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":12854,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:59:18","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'\n\n\ndef fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19214,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:59:18","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":16425,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:59:18","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":9578,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:59:18","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'\n\n\ndef fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11480,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 10:59:18","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":1289,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:03:01","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":22730,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:03:01","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17746,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:03:01","func_code":"def fibonacci(x):\n if x <= 1:\n return x\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32547,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:09:47","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":12438,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:09:47","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":30856,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:09:47","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":8562,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:09:47","func_code":"def fibonacci(x):\n if x <= 1:\n return x\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":31039,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:09:47","func_code":"def fibonacci(x):\n if x <= 1:\n return x\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":30062,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:09:47","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":25005,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:12:21","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":42212,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:12:21","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9647,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:12:21","func_code":"def fibonacci(x):\n if x <= 1:\n return x\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39346,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:12:21","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38360,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:12:21","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":6970,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:12:21","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":28451,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:12:21","func_code":"def fibonacci(x):\n if x <= 1:\n return x\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5606,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:12:21","func_code":"def fibonacci(x):\n if x <= 1:\n return x\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15950,"user":"b842b3b5-71ff-4f80-9bd4-d5973c3f5123","date":"2018-03-20 11:12:21","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":35160,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:30:52","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":39726,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:30:52","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i += 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":18478,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:30:52","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return febonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7433,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:31:32","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":34351,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:31:32","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35147,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:31:32","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":166,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:31:32","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11387,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:31:32","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i += 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":4019,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:31:32","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39646,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:31:32","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i += 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":29228,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:31:32","func_code":"def index(str, letter):\n if letter not in str:\n return -1\n else:\n return str.find(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":13445,"user":"7ee35977-e007-4398-99c0-ea42a300ff3c","date":"2018-03-20 11:31:32","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter in str:\n return True\n else:\n return False\n i += 1","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":22602,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:41:39","func_code":"def weird_case(some_str):\n print(some_str.split())","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":33829,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:41:39","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24976,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:45:35","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34191,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:45:35","func_code":"def weird_case(some_str):\n return some_str.split()","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21662,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:46:26","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":10137,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:46:26","func_code":"def weird_case(some_str):\n str = some_str.split()\n return str[0]","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35698,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:48:00","func_code":"def weird_case(some_str):\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word.upper()\n print(caps_first)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11601,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:48:00","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39295,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:48:21","func_code":"def weird_case(some_str):\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word.upper()\n return caps_first","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29578,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:48:21","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31957,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:50:28","func_code":"def weird_case(some_str):\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word % 2 == 0\n return caps_first","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39060,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:50:28","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":14816,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:51:02","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":15384,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:51:02","func_code":"def weird_case(some_str):\n str = some_str.split()\n first_word = str[0]\n caps_first = str(first_word % 2 == 0)\n return caps_first","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40246,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:51:33","func_code":"def weird_case(some_str):\n str = some_str.split()\n first_word = str[0]\n caps_first = int(first_word % 2 == 0)\n return caps_first","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":5535,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:51:33","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":653,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:53:34","func_code":"def weird_case(some_str):\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2]\n return caps_first","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22961,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:53:34","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":15287,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:55:32","func_code":"def weird_case(some_str):\n c = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.append[c]\n return c","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21825,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:55:32","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7927,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:57:00","func_code":"def weird_case(some_str):\n c = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n c.append(caps_first)\n return c","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18222,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:57:00","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35359,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:59:54","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24226,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 11:59:54","func_code":"def weird_case(some_str):\n c = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n c.append(caps_first)\n c.append(first_word)\n return c","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25535,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:00:24","func_code":"def weird_case(some_str):\n c = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n c.append(caps_first)\n c.append(first_word)\n return c.split(',')","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":5256,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:00:24","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":5932,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:01:54","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30339,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:01:54","func_code":"def weird_case(some_str):\n c = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n c.append(caps_first)\n c.append(first_word)\n c = c.split(',')\n return c","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":19803,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:05:04","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17901,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:05:04","func_code":"def weird_case(some_str):\n c = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n if caps_first in first_word:\n del first_word\n return first_word","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24645,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:09:21","func_code":"def weird_case(some_str):\n c = []\n b = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.split()\n c.append(caps_first)\n first_wprd.split()\n b.append(first_word)\n return b","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":41769,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:09:21","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":21732,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:09:46","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":6403,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:09:46","func_code":"def weird_case(some_str):\n c = []\n b = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.split()\n c.append(caps_first)\n first_word.split()\n b.append(first_word)\n return b","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39924,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:10:20","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17414,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:10:20","func_code":"def weird_case(some_str):\n c = []\n b = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.split(' ')\n c.append(caps_first)\n first_word.split(' ')\n b.append(first_word)\n return b","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24956,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:17:46","func_code":"def weird_case(some_str):\n c = []\n b = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.split(' ')\n first_word.split(' ')\n i = 0\n while i < len(caps_first):\n if caps_first[i] in first_word:\n del caps_first[i]\n else:\n i = i + 1\n return caps_first","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10641,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:17:46","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24140,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:18:28","func_code":"def weird_case(some_str):\n c = []\n b = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.split(' ')\n first_word.split(' ')\n i = 0\n while i < len(caps_first):\n if caps_first[i] in first_word:\n del first_word[i]\n else:\n i = i + 1\n return caps_first","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":41889,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:18:28","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35338,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:18:54","func_code":"def weird_case(some_str):\n c = []\n b = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.split(' ')\n first_word.split(' ')\n return caps_first","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11488,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:18:54","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41761,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:21:04","func_code":"def weird_case(some_str):\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.split(' ')\n first_word.split(' ')\n if caps_first == first_word.upper():\n del first_word\n return first_word","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6694,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:21:04","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2840,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:23:19","func_code":"def weird_case(some_str):\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.split(',')\n first_word.split(',')\n for caps_first in first_word:\n caps_first.append(caps_first.remove())\n return caps_first","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":18567,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:23:19","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23714,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:24:36","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":18335,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:24:36","func_code":"def weird_case(some_str):\n c = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.split(',')\n c.append(caps_first)\n first_word.split(',')\n for caps_first in first_word:\n c.append(caps_first.remove())\n return c","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":35044,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:24:36","func_code":"def weird_case(some_str):\n c = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.split(',')\n c.append(caps_first)\n first_word.split(',')\n for caps_first in first_word:\n c.append(caps_first.remove())\n return c","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4285,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:24:36","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":33585,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:24:36","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":37854,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-20 12:24:36","func_code":"def weird_case(some_str):\n c = []\n str = some_str.split()\n first_word = str[0]\n caps_first = first_word[::2].upper()\n caps_first.split(',')\n c.append(caps_first)\n first_word.split(',')\n for caps_first in first_word:\n c.append(caps_first.remove())\n return c","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":6807,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-03-20 12:49:28","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":4020,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-03-20 12:49:28","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":17709,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-03-20 12:49:28","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n dist = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n return dist < r1 + r2","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":true} {"submission_id":28913,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-20 15:36:33","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":28012,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-20 15:36:33","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n elif letter not in str:\n return '-1'\n else:\n return index(str[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5599,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-20 15:36:33","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":12218,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-20 15:36:33","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":37744,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-20 15:36:33","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n elif letter not in str:\n return '-1'\n else:\n return index(str[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15457,"user":"4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b","date":"2018-03-20 15:36:33","func_code":"def index(str, letter):\n if letter in str:\n return str.find(letter)\n elif letter not in str:\n return '-1'\n else:\n return index(str[1:], letter)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21885,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:18:18","func_code":"def search(ls, val, na=0):\n pos = len(ls)\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)\n\n\ndef index(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":26503,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:18:18","func_code":"def search(ls, val, na=0):\n pos = len(ls)\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":14429,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:18:18","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8204,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:22:53","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4977,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:22:53","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":6757,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:22:53","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":31144,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:28:33","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":36911,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:28:33","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":35083,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:28:33","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12905,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:28:33","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8624,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:28:33","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":11223,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:28:33","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":29285,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:28:33","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":40631,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:28:33","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(ls, val, pos):\n if pos == len(ls):\n return False\n elif ls[pos] == val:\n return True\n else:\n return search(ls, val, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":36869,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-20 16:28:33","func_code":"def fibonacci(n):\n a = [0, 1, 1]\n i = 3\n while i < n:\n a.append(a[i - 1] + a[i - 2])\n i = i + 1\n a.append(a[i - 1] + a[i - 2])\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":27170,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:09:00","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":31308,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:09:00","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i += 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7088,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:09:00","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i += 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":4820,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:09:00","func_code":"def fibonacci(n):\n fib = [0, 1]\n i = 2\n while i < n + 1:\n tmp = int(fib[i - 2]) + int(fib[i - 1])\n fib.append(tmp)\n i += 1\n return fib[n]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37150,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:09:00","func_code":"def index(string, letter):\n if letter in string:\n i = 0\n while i < len(string):\n if letter == string[i]:\n return i\n i += 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":40811,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:09:00","func_code":"def search(string, letter):\n if letter in string:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":16964,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:13:13","func_code":"def index(string, letter, place=0):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return place\n else:\n place = place + 1\n return index(string[1:], letter, place=place)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":34111,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:13:13","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n == 2:\n return 1\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":328,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:13:13","func_code":"def search(string, letter):\n if string == '':\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":339,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:14:01","func_code":"def search(string, letter):\n if string == '':\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":431,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:14:01","func_code":"def search(string, letter):\n if string == '':\n return False\n elif string[0] == letter:\n return True\n else:\n return search(string[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":7276,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:14:01","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n == 2:\n return 1\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":30033,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:14:01","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n elif n == 2:\n return 1\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8199,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:14:01","func_code":"def index(string, letter, place=0):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return place\n else:\n place = place + 1\n return index(string[1:], letter, place=place)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7266,"user":"5c105474-42d8-4a95-a311-034a93c693c8","date":"2018-03-21 01:14:01","func_code":"def index(string, letter, place=0):\n if string == '':\n return '-1'\n elif string[0] == letter:\n return place\n else:\n place = place + 1\n return index(string[1:], letter, place=place)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":1680,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 08:52:48","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25806,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:18:42","func_code":"def weird_case(some_str):\n some_str = some_str.upper()\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4745,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:18:42","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13881,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:19:06","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":39522,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:19:06","func_code":"def weird_case(some_str):\n some_str = some_str.upper() % 2 == 0\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":7038,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:19:34","func_code":"def weird_case(some_str):\n some_str = int(some_str.upper() % 2 == 0)\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11649,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:19:34","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":31536,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:19:49","func_code":"def weird_case(some_str):\n some_str = str(some_str.upper() % 2 == 0)\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28793,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:19:49","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30559,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:20:28","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7316,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:20:28","func_code":"def weird_case(some_str):\n some_str = some_str[::2].upper()\n return some_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21852,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:23:37","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n for some_str[::2] in some_str:\n i = i + 1\n return some_str.upper()","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1526,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:23:37","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":27748,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:24:32","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n i = i + 1\n return some_str.upper()","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":41910,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:24:32","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":20843,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:26:24","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":3377,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:26:24","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n i = i + 1\n upper_case = some_str.upper()\n lower = int(upper_case)[::2].lower()\n return lower","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":32515,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:27:08","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13561,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:27:08","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n i = i + 1\n upper_case = some_str.upper()\n return upper_case","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":2121,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:28:14","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n i = i + 1\n upper_case = some_str.upper()\n upper_case.split()[1].lower()\n print(upper_case)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27778,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:28:14","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41416,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:29:01","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23106,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:29:01","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n i = i + 1\n upper_case = some_str.upper()\n upper_sec = upper_case.split()[1].lower()\n return upper_sec","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29241,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:34:38","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":3009,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:34:38","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23634,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:34:38","func_code":"def weird_case(some_str):\n i = 0\n while i < len(some_str):\n i = i + 1\n upper_case = some_str.upper()\n upper_sec = upper_case.split()[1].lower()\n return upper_sec","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13907,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:39:23","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":26432,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:39:23","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":25799,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:39:23","func_code":"def weird_case(some_str):\n word = ''\n i = True\n for char in some_str:\n if i:\n word += char.upper()\n else:\n word += char.lower()\n if char != ' ':\n i = not i\n return word","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13463,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:41:48","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":20871,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:41:48","func_code":"def weird_case(some_str):\n word = ''\n b = True\n for char in some_str:\n word += char.upper() if b else char.lower()\n if char.isalpha():\n b = not b\n return word","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":29010,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:41:48","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":13080,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:41:48","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":18496,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:41:48","func_code":"def merge_lists(l1, l2):\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17795,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:41:48","func_code":"def weird_case(some_str):\n word = ''\n b = True\n for char in some_str:\n word += char.upper() if b else char.lower()\n if char.isalpha():\n b = not b\n return word","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1811,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:48:18","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":1507,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:48:18","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":5088,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:48:18","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n letter_pos = i + 1\n i = i + 1\n return letter_pos","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41993,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:49:09","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n i = i + 1\n return pos","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":16481,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:49:09","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":13361,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:49:09","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n i = i + 1\n return pos\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":15702,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:49:33","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n i = i + 1\n return pos\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2491,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:49:33","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":41633,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:49:33","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n i = i + 1\n return pos\n return '-1'\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":9020,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:50:59","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":18714,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:50:59","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":35050,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:50:59","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i + 1\n return '-1'\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":28551,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:52:03","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n i = i + 1\n return pos\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15233,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:52:03","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n i = i + 1\n return pos\n return '-1'\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":9484,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:52:03","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":25186,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:52:53","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n i = i + 1\n return pos\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":37057,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:52:53","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n i = i + 1\n return pos","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":6195,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:52:53","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":33772,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:56:17","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i + 1\n if letter not in str:\n return '-1'\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":24317,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:56:17","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i + 1\n if letter not in str:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":38862,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:56:17","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":2467,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:56:48","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i + 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15757,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:56:48","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":25004,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:56:48","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i + 1\n return '-1'\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":13850,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:57:21","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return -1\n i = i + 1\n return '1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4671,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:57:21","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return -1\n i = i + 1\n return '1'\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":8092,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:57:21","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":24560,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:58:36","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":39590,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:58:36","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n else:\n return '-1'\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":600,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 09:58:36","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37140,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 10:00:28","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i = 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":30478,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 10:00:28","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i = 1\n return '-1'\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":2747,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 10:00:28","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":26885,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 10:01:05","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":22923,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 10:01:05","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i + 1\n return '1'\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":31942,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 10:01:05","func_code":"def index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i + 1\n return '1'\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":27198,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 10:01:05","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":30827,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 10:01:05","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i + 1\n return '1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2899,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-21 10:01:05","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n i = str[0]\n pos = 1\n while i < len(str):\n if letter in str:\n pos = i + 1\n return pos\n i = i + 1\n return '1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10661,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-21 10:32:39","func_code":"def index(str, letter, num):\n n = 0\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":21894,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-21 10:32:39","func_code":"def index(str, letter, num):\n n = 0\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":33451,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-21 10:32:39","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n n2 = list[i] + list[i - 1]\n else:\n n2 = list[i] + 1\n list.append(n2)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":10521,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-21 10:32:39","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n n2 = list[i] + list[i - 1]\n else:\n n2 = list[i] + 1\n list.append(n2)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":4170,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-21 10:32:39","func_code":"def index(str, letter, num):\n n = 0\n if letter in str:\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n else:\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28554,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-21 10:32:39","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":39263,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-21 10:32:39","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":8865,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-21 10:32:39","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n n2 = list[i] + list[i - 1]\n else:\n n2 = list[i] + 1\n list.append(n2)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":15891,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-21 10:32:39","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":8884,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-21 12:55:21","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":31632,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-21 12:55:21","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":38471,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-21 12:55:21","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":31631,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2018-03-21 13:16:47","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":743,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2018-03-21 13:16:47","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":10465,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2018-03-21 13:16:47","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":3570,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2018-03-21 13:16:47","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32704,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2018-03-21 13:16:47","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":16698,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2018-03-21 13:16:47","func_code":"def index(str, letter):\n if letter in str:\n return 1\n else:\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19576,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2018-03-21 13:16:47","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20825,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2018-03-21 13:16:47","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15573,"user":"415d4431-1b98-4241-a978-02dc16bf556e","date":"2018-03-21 13:16:47","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32211,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:17:40","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":26455,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:17:40","func_code":"def index(string, letter):\n if letter not in string:\n return '-1'\n if letter in string:\n a = list(string)\n return a.index(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":13853,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:17:40","func_code":"def fibonacci(n):\n previous = 0\n current = 1\n i = 1\n while i < n:\n temp = current\n current += previous\n previous = temp\n i = i + 1\n return current","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":10201,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:18:13","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":40247,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:18:13","func_code":"def index(string, letter):\n if letter not in string:\n return '-1'\n if letter in string:\n a = list(string)\n return a.index(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":20337,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:18:13","func_code":"def fibonacci(n):\n previous = 0\n current = 1\n i = 0\n while i < n:\n temp = current\n current += previous\n previous = temp\n i = i + 1\n return current","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":31595,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:20:05","func_code":"def index(string, letter):\n if letter not in string:\n return '-1'\n if letter in string:\n a = list(string)\n return a.index(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8343,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:20:05","func_code":"def fibonacci(n):\n previous = 0\n current = 1\n i = 1\n while i < n:\n temp = current\n current += previous\n previous = temp\n i = i + 1\n return current","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":12134,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:20:05","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":15269,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:20:57","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":38607,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:20:57","func_code":"def index(string, letter):\n if letter not in string:\n return '-1'\n if letter in string:\n a = list(string)\n return a.index(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":32488,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:20:57","func_code":"def fibonacci(n):\n previous = 0\n current = 1\n i = 1\n while i < n:\n temp = current\n current += previous\n previous = temp\n i = i + 1\n return current","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37175,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:25:36","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":574,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:25:36","func_code":"def fibonacci(n):\n previous = 0\n current = 1\n i = 1\n if n < 1:\n return 0\n while i < n:\n temp = current\n current += previous\n previous = temp\n i = i + 1\n return current","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":29040,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:25:36","func_code":"def index(string, letter):\n if letter not in string:\n return '-1'\n if letter in string:\n a = list(string)\n return a.index(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":5345,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:25:36","func_code":"def index(string, letter):\n if letter not in string:\n return '-1'\n if letter in string:\n a = list(string)\n return a.index(letter)","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":42223,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:25:36","func_code":"def fibonacci(n):\n previous = 0\n current = 1\n i = 1\n if n < 1:\n return 0\n while i < n:\n temp = current\n current += previous\n previous = temp\n i = i + 1\n return current","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":36042,"user":"4205f21d-1c6e-499a-a25c-83a2d9d5ad93","date":"2018-03-21 16:25:36","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":41547,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:17:10","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":8118,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:17:10","func_code":"def index(str, letter, pos):\n if pos in len(str):\n return -1\n elif str[pos] in letter:\n return pos\n elif recursive in str:\n return 1\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3565,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:17:10","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":26816,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:18:18","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":7175,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:18:18","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":18948,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:18:18","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":25058,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:18:18","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":41056,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:18:18","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":11065,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:18:18","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":7998,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:24:58","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36121,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:24:58","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":30710,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:24:58","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21286,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:25:28","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":32455,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:25:28","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":24075,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:25:28","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":32646,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:25:28","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":7752,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:25:28","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i = i + 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9124,"user":"169d7a9e-d0dd-4e8b-937d-fcd76c099acc","date":"2018-03-24 00:25:28","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":26948,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 08:19:11","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":8692,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 08:19:11","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":40779,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 08:19:11","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":30091,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 13:57:11","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":28463,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 13:57:11","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":34039,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 13:57:11","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":11869,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 13:57:11","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":38433,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 13:57:11","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":21196,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 13:57:11","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":40997,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 13:57:11","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":4811,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 13:57:11","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":621,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-24 13:57:11","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":42086,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-24 19:16:29","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":32191,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-24 19:16:29","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":25190,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-24 19:16:29","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":4788,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-24 19:16:29","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":22185,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-24 19:16:29","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":41351,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-24 19:16:29","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":26167,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-24 19:16:29","func_code":"def fibonacci(n):\n list = [0]\n i = 0\n while n >= len(list):\n if len(list) > 1:\n new_num = list[i] + list[i - 1]\n else:\n new_num = list[i] + 1\n list.append(new_num)\n i = i + 1\n return list[-1]","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":6629,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-24 19:16:29","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":31869,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-24 19:16:29","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n else:\n i = i + 1\n if i == len(str):\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28494,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:20:31","func_code":"def search(str, letter):\n if letter in str:\n print('True')\n else:\n print('False')","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":24430,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:27:50","func_code":"def index(str, letter):\n if letter not in str:\n return '-1'\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i += 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7359,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:27:50","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":3221,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:51:51","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":7183,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:51:51","func_code":"def index(str, letter):\n if letter not in str:\n return '-1'\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i += 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":27395,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:51:51","func_code":"def fibonacci(n):\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n i = 10\n while i < 20:\n new = int(fib[i - 1]) + int(fib[i - 2])\n fib.append(new)\n i += 1\n j = 1\n while j < len(fib):\n if j == n:\n return fib[j]\n j += 1","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38221,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:53:00","func_code":"def index(str, letter):\n if letter not in str:\n return '-1'\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i += 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31278,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:53:00","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":31234,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:53:00","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":33987,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:53:00","func_code":"def fibonacci(n):\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n i = 10\n while i < 20:\n new = int(fib[i - 1]) + int(fib[i - 2])\n fib.append(new)\n i += 1\n j = 1\n while j < len(fib):\n if j == n:\n return fib[j]\n j += 1\n if n == 0:\n return 0","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19276,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:53:00","func_code":"def index(str, letter):\n if letter not in str:\n return '-1'\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i += 1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":9025,"user":"e44b26cb-9ae2-4852-8e5e-b3d0f2b1ec60","date":"2018-03-25 14:53:00","func_code":"def fibonacci(n):\n fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n i = 10\n while i < 20:\n new = int(fib[i - 1]) + int(fib[i - 2])\n fib.append(new)\n i += 1\n j = 1\n while j < len(fib):\n if j == n:\n return fib[j]\n j += 1\n if n == 0:\n return 0","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33315,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-25 15:15:57","func_code":"def weird_case(some_str):\n i = 0\n ls = []\n while i < len(some_str):\n if i % 2 == 0:\n ls.append(some_str[i].upper())\n else:\n ls.append(some_str[i].lower())\n i = i + 1\n return ''.join(ls)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27000,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-25 15:15:57","func_code":"def merge_lists(l1, l2):\n a = l1[0::2]\n b = l2[0::2]\n return a + b","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25452,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-25 15:15:57","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n else:\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":22931,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-25 15:15:57","func_code":"def weird_case(some_str):\n i = 0\n ls = []\n while i < len(some_str):\n if i % 2 == 0:\n ls.append(some_str[i].upper())\n else:\n ls.append(some_str[i].lower())\n i = i + 1\n return ''.join(ls)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":40794,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-25 15:15:57","func_code":"def merge_lists(l1, l2):\n a = l1[0::2]\n b = l2[0::2]\n return a + b","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23057,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-25 15:15:57","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n else:\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":23582,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-25 15:15:57","func_code":"def merge_lists(l1, l2):\n a = l1[0::2]\n b = l2[0::2]\n return a + b","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":25982,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-25 15:15:57","func_code":"def weird_case(some_str):\n i = 0\n ls = []\n while i < len(some_str):\n if i % 2 == 0:\n ls.append(some_str[i].upper())\n else:\n ls.append(some_str[i].lower())\n i = i + 1\n return ''.join(ls)","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":42073,"user":"94e64aae-7bb0-45bd-8969-e98b17d0a3da","date":"2018-03-25 15:15:57","func_code":"def remove_zeros(list):\n i = 0\n while i < len(list):\n if list[i] == 0:\n del list[i]\n else:\n i = i + 1\n return list","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":false} {"submission_id":16996,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-25 17:34:47","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":35507,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-25 17:34:47","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14288,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-25 17:34:47","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25842,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-25 17:34:47","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":23621,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-25 17:34:47","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":9907,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-25 17:34:47","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38390,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-25 17:34:47","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":19798,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-25 17:34:47","func_code":"def merge_lists(l1, l2):\n i = 0\n l3 = l1[::2] + l2[::2]\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":23327,"user":"7c4a70b0-f238-44c3-98e9-fba759a5438b","date":"2018-03-25 17:34:47","func_code":"def weird_case(some_str):\n string = ''\n i = True\n for char in some_str:\n if i:\n string += char.upper()\n else:\n string += char.lower()\n if char != ' ':\n i = not i\n return string\n\n\ndef remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":15480,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-25 20:07:53","func_code":"def bsearch(a, q):\n a = sorted(a)\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] > q:\n high = mid\n else:\n low = mid + 1\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":32049,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-25 20:14:54","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] > q:\n high = mid\n else:\n low = mid + 1\n return mid","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":40601,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-25 20:15:10","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] > q:\n high = mid\n else:\n low = mid + 1\n return mid - 1","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":41937,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-25 20:15:20","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] > q:\n high = mid\n else:\n low = mid + 1\n return mid","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":38151,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-25 20:16:39","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] > q:\n high = mid\n else:\n low = mid + 1\n return low - 1","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":27152,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-25 20:16:49","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] > q:\n high = mid\n else:\n low = mid + 1\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":29021,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-25 20:18:26","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] > q:\n high = mid\n else:\n low = mid + 1\n return mid","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":3953,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-25 20:27:09","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] > q:\n high = mid\n elif a[mid] < q:\n low = mid + 1\n else:\n i = 0\n while i < len(a) and a[i] != q:\n i = i + 1\n return i\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":11280,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-25 20:30:00","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] > q:\n high = mid\n assert q <= a[high]\n else:\n low = mid + 1\n assert low == 0 or a[low - 1] < a\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":24940,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-25 20:30:58","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert low == 0 or a[low - 1] < a\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":12543,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-03-25 20:30:58","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n assert low <= mid < high\n if a[mid] < q:\n low = mid + 1\n assert low == 0 or a[low - 1] < a\n else:\n high = mid\n assert q <= a[high]\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":24203,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-26 20:32:10","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":30930,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-26 20:32:10","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17277,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-26 20:32:10","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":22068,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-26 20:32:10","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38711,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-26 20:32:10","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":2433,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-26 20:32:10","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":2830,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-26 20:32:10","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":21040,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-26 20:32:10","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":14393,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-03-26 20:32:10","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":28233,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-27 08:48:51","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":30126,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-27 08:48:51","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":11442,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-27 08:48:51","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":13106,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-27 08:48:51","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":29915,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-27 08:48:51","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":41117,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-27 08:48:51","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":24285,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-27 08:48:51","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":18891,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-27 08:48:51","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":14047,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-27 08:48:51","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":12802,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 08:58:55","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'\n\n\ndef fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12076,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 08:58:55","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":8438,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 08:58:55","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":1976,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:09:59","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":33407,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:09:59","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'\n\n\ndef fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":34668,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:09:59","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":9043,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:12:51","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'\n\n\ndef fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a\n\n\ndef index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8583,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:12:51","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":19834,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:12:51","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return search(str, letter, pos + 1)\n\n\ndef search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":301,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:18:08","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return 'False'\n elif str[pos] == letter:\n return 'True'\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":31043,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:18:08","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":15408,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:18:08","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":22548,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:19:19","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":12674,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:19:19","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return '-1'\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7469,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:19:19","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return '-1'\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3427,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:19:19","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":42081,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:19:19","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":7249,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:19:19","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":18316,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:19:19","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return '-1'\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":19931,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:19:19","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return 'True'\n i = i + 1\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":36430,"user":"e380b6f8-84c6-4978-a85b-78c22ace6b9b","date":"2018-03-27 09:19:19","func_code":"def fibonacci(n):\n a, b = 0, 1\n for i in range(n):\n a, b = b, a + b\n return a","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":13132,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-27 16:22:09","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 >= (r1 + r2) ** 2:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":40059,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-03-27 16:22:09","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 >= (r1 + r2) ** 2:\n return False\n else:\n return True","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4310,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-27 17:42:57","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":4951,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-27 17:42:57","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":3266,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-27 17:42:57","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":8414,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-27 17:42:57","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":37220,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-27 17:42:57","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":5323,"user":"dbbf7e1a-95ff-4b8a-b26d-18d6ccae623c","date":"2018-03-27 17:42:57","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":5587,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-28 12:04:48","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":5381,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-28 12:04:48","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":40186,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-28 12:04:48","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":11163,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-28 12:04:48","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":16007,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-28 12:04:48","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":11411,"user":"9de68f60-663e-4929-b3e2-88948f90a669","date":"2018-03-28 12:04:48","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":26325,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-28 12:51:41","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37801,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-28 12:51:41","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":8802,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-28 12:51:41","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":36566,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-28 12:51:41","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":7836,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-28 12:51:41","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":37249,"user":"c601c339-f2b7-4564-a96b-2de852eabb7b","date":"2018-03-28 12:51:41","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":38653,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:24:17","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":16585,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:24:17","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":11018,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:24:17","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":41644,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:25:16","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":40688,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:25:16","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":35014,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:25:16","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":17333,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:25:16","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":31627,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:25:16","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":34846,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:25:16","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":14933,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:25:16","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":9889,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:25:16","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":21317,"user":"d31360b5-795b-45df-bd6f-a99df2683eae","date":"2018-03-28 13:25:16","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":10656,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:32:53","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n while i < len(some_str):\n if 'a' <= some_str[i] <= 'z':\n j += 1\n if j % 2 == 1:\n print(upper(some_str[i]))\n else:\n print(some_str[i])\n else:\n print(some_str[i])\n i += 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":39534,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:32:53","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17396,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:33:33","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":7771,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:33:33","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n while i < len(some_str):\n if 'a' <= some_str[i] <= 'z':\n j += 1\n if j % 2 == 1:\n print(upper(some_str[i]))\n else:\n print(some_str[i])\n else:\n print(some_str[i])\n i += 1","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":20522,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:52:29","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":19532,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:52:29","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":15551,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:53:50","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":27258,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:53:50","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":5799,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:53:50","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":36551,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:54:22","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":15893,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:54:22","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":6214,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:54:22","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":11825,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:54:22","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":21471,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:54:22","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":23513,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:54:22","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24870,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:54:22","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16535,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:54:22","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21532,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-28 14:54:22","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":16539,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-03-28 16:39:37","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":30365,"user":"d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb","date":"2018-03-28 16:39:37","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":23339,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-28 16:54:57","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":27340,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-28 16:54:57","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":10139,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-28 16:54:57","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":16281,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-28 16:54:57","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":5708,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-28 16:54:57","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":4290,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-28 16:54:57","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":35022,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-28 16:54:57","func_code":"def search(string, letter):\n if letter not in string:\n return 'False'\n else:\n return 'True'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":34782,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-28 16:54:57","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":10372,"user":"a93c9eeb-104a-4436-bd9a-c2e65d311d9e","date":"2018-03-28 16:54:57","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":11576,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:27:19","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34307,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:27:19","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":24173,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:27:19","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":27512,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:27:19","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":24831,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:27:19","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":4989,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:27:19","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":10396,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:29:23","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38213,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:29:23","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28232,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:29:23","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26462,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:29:23","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":32578,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:29:23","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":3545,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:29:23","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if str[i] == letter:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":2992,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:30:25","func_code":"def index(str, letter1, letter2):\n i = 0\n while i < len(str):\n if str[i] == letter1:\n return i\n i += 1\n return '-1'\n i = 0\n while i < len(str):\n if str[i] == letter2:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":12650,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:30:25","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":26856,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:30:25","func_code":"def search(str, letter):\n if letter in str:\n return 'True'\n else:\n return 'False'","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":16023,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:30:25","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":24097,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:30:25","func_code":"def index(str, letter1, letter2):\n i = 0\n while i < len(str):\n if str[i] == letter1:\n return i\n i += 1\n return '-1'\n i = 0\n while i < len(str):\n if str[i] == letter2:\n return i\n i += 1\n return '-1'","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":18337,"user":"7d0d82bd-2bdb-48da-a37f-ffa6ee59d960","date":"2018-03-28 17:30:25","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":4907,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-03-28 18:27:04","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":939,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-03-28 18:27:04","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":28265,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-03-28 18:27:04","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":25546,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-03-28 18:44:18","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":20841,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-03-28 18:44:18","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":19019,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-03-28 18:44:18","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8814,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-03-28 18:44:18","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":1656,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-03-28 18:44:18","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":18195,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-03-28 18:44:18","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":17234,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:45","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":6519,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:45","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":41315,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:45","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":17188,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:46","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":7242,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:46","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":16701,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:46","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":11491,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:47","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":1491,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:47","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":4002,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:47","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":29702,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:47","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":25115,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:47","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34412,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:47","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":34988,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:47","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":11093,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:47","func_code":"def merge_lists(l1, l2):\n import sys\n merged_list = []\n i = 0\n while i < len(l1):\n merged_list.append(l1[i])\n i = i + 2\n i = 0\n while i < len(l2):\n merged_list.append(l2[i])\n i += 2\n return merged_list","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":34480,"user":"5ba5010e-c0ac-4560-9fa6-aadbc278c3f8","date":"2018-03-29 14:33:47","func_code":"def weird_case(some_str):\n i = 0\n j = 0\n new_str = ''\n while i < len(some_str):\n if some_str[i].isalpha():\n if j % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n j += 1\n else:\n new_str += some_str[i]\n i += 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":41706,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-30 23:37:58","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":11145,"user":"b33a8ad6-3321-48f9-b796-fc62eb24c45f","date":"2018-03-30 23:37:58","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = (x2 - x1) ** 2 + (y2 - y1) ** 2\n if distance < (r1 + r2) ** 2:\n return True\n else:\n return False","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":6376,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-04-02 23:09:48","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":21470,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-04-02 23:09:48","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":17778,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-04-02 23:09:48","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":41407,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-04-02 23:09:48","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":40298,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-04-02 23:09:48","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":15482,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-04-02 23:09:48","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":17570,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-04-02 23:09:48","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":16690,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-04-02 23:09:48","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":21248,"user":"f40d6a8a-0620-4bda-8c98-4c952edace05","date":"2018-04-02 23:09:48","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":3547,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:34:53","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":5161,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:34:53","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":41063,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:35:05","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14883,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:35:05","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":6047,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:35:31","func_code":"def power(m, n):\n if not n:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":31758,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:35:31","func_code":"def power(m, n):\n if not n:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":21784,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:35:44","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n tail_min = minimum(l[1:])\n return l[0] if l[0] < tail_min else tail_min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":30370,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:35:44","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n tail_min = minimum(l[1:])\n return l[0] if l[0] < tail_min else tail_min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":27829,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:36:06","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n tail_max = maximum(l[1:])\n return l[0] if l[0] > tail_max else tail_max","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":14884,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:37:22","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n tail_max = maximum(l[1:])\n return l[0] if l[0] > tail_max else tail_max","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":20639,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:37:22","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n tail_max = maximum(l[1:])\n return l[0] if l[0] > tail_max else tail_max","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":28227,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 13:37:39","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":8838,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:37:41","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":19067,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:37:41","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":13695,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:37:51","func_code":"def reverse_list(l):\n if l == []:\n return []\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":20498,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:37:51","func_code":"def reverse_list(l):\n if l == []:\n return []\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":29974,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:38:01","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":3285,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:38:01","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":4640,"user":"b1593687-e1b6-4969-bf98-9b229efc6797","date":"2018-04-03 13:38:01","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39252,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 13:38:16","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":38436,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 13:38:28","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":5696,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 13:39:35","func_code":"def sumup(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":16679,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 13:39:55","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":15436,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 13:39:55","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":8866,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 13:40:50","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":25636,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 13:40:50","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":7500,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 13:40:58","func_code":"def factorial(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":31503,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 13:41:45","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36826,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 13:41:45","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":9449,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 13:43:42","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":21232,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 13:43:42","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":24314,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:44:52","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + (n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":34542,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:45:20","func_code":"def sumup(n):\n if n == 0:\n return 1\n return n + (n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":30038,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 13:45:23","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":19158,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 13:45:23","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20605,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 13:45:43","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":37905,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 13:45:43","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22408,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 13:45:51","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif n == 1:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":22040,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 13:45:51","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif n == 1:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":37947,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:45:53","func_code":"def sumup(n):\n if n == 0:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":5131,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:46:07","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":32622,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:46:57","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":26439,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:46:57","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":3753,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:46:59","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":30804,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:46:59","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":8948,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 13:48:33","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":10764,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 13:48:33","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":39678,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:48:39","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":38200,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:49:32","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":39984,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 13:50:27","func_code":"def sumup(n):\n if n == 1:\n return 1\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":39391,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 13:51:41","func_code":"def sumup(n):\n if n == 1:\n return 1\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":29423,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:52:11","func_code":"def factorial(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":35560,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:52:29","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":35371,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:52:39","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":32982,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:52:47","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12704,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:52:47","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41392,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 13:52:52","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":3987,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 13:52:52","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":5927,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:52:53","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":19875,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:53:02","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20358,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:53:02","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14048,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 13:53:06","func_code":"def sumup(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":15981,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 13:53:42","func_code":"def sumup(n):\n if n == 1:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":32495,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 13:54:11","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":25416,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 13:54:11","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":2683,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 13:54:15","func_code":"def sumup(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":21746,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 13:54:20","func_code":"def factorial(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n sum_to_n_1 = sumup(n - 1)\n return n * sum_to_n_1","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":10631,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 13:54:34","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":40927,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 13:54:39","func_code":"def factorial(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n sum_to_n_1 = factorial(n - 1)\n return n * sum_to_n_1","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24809,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:55:14","func_code":"def power(n, p):\n if p == 0:\n return 0\n return n ** p","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":33535,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 13:55:26","func_code":"def factorial(n):\n if n == 0:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":33523,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 13:55:43","func_code":"def factorial(n):\n if n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7368,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:55:47","func_code":"def power(n, p):\n if n == 0:\n return 0\n elif p == 0:\n return 1\n return n ** p","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":30395,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:55:47","func_code":"def power(n, p):\n if n == 0:\n return 0\n elif p == 0:\n return 1\n return n ** p","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":4966,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 13:55:55","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n ** p","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":14590,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 13:56:12","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":10038,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 13:56:12","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":4059,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 13:56:42","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":13558,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 13:56:42","func_code":"def sumup(n):\n if n == 0:\n return 1\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":14442,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 13:56:50","func_code":"def sumup(n):\n if n == 0:\n return 0\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":35824,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 13:56:50","func_code":"def sumup(n):\n if n == 0:\n return 0\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":1085,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:57:38","func_code":"def minimum(l):\n return min(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":40569,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 13:57:38","func_code":"def sumup(n):\n if n == 1:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":19508,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:57:38","func_code":"def minimum(l):\n return min(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":11451,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 13:57:41","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":41005,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 13:57:41","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":13430,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 13:57:55","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":28181,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 13:57:55","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":13935,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 13:58:03","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":35969,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:58:28","func_code":"def maximum(l):\n return max(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":24513,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:58:28","func_code":"def maximum(l):\n return max(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":31651,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 13:58:37","func_code":"def sumup(n):\n if n == 0:\n return 0\n sum_to_n_minus_1 = sumup(n - 1)\n return n + sum_to_n_minus_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":15061,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 13:58:37","func_code":"def sumup(n):\n if n == 0:\n return 0\n sum_to_n_minus_1 = sumup(n - 1)\n return n + sum_to_n_minus_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":17919,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 13:58:43","func_code":"def factorial(n):\n if n == 1:\n return 1\n factorial_of_n = factorial(n - 1)\n return n * factorial_of_n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":25640,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:59:35","func_code":"def count_letters(s):\n return len(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30557,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 13:59:35","func_code":"def count_letters(s):\n return len(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30325,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 13:59:40","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":1082,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 13:59:51","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":25388,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 13:59:51","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":5113,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 14:00:09","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":26094,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:00:17","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":33699,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:00:21","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24472,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:00:28","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":5103,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:00:28","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":18458,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:00:29","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":10525,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:00:29","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":29869,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:00:37","func_code":"def factorial(n):\n if n == 0:\n return 0\n fact_of_n = n - 1\n return n * fact_of_n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":37763,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 14:00:40","func_code":"def minimum(a):\n minim = None\n if len(a) == 1:\n return a[0]\n newm = minimum(a[1:])\n if a[0] < newm:\n return a[0]\n else:\n return newm","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":40494,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 14:00:40","func_code":"def minimum(a):\n minim = None\n if len(a) == 1:\n return a[0]\n newm = minimum(a[1:])\n if a[0] < newm:\n return a[0]\n else:\n return newm","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":34418,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 14:00:51","func_code":"def sumup(n):\n if n == 1:\n return 1\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":37304,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:00:52","func_code":"def factorial(n):\n if n == 0:\n return 0\n fact_of_n = n - 1\n return n * fact_of_n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36298,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 14:00:54","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12512,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 14:00:54","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":10439,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:00:57","func_code":"def sumup(n):\n if n == 1:\n return n\n return n + (n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":13909,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:01:16","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14014,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:01:16","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39746,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:01:32","func_code":"def sumup(n):\n if n == 0:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":3622,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:01:34","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":31137,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:01:34","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22149,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 14:01:36","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":3363,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 14:01:36","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":21074,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 14:01:47","func_code":"def maximum(a):\n minim = None\n if len(a) == 1:\n return a[0]\n newmax = maximum(a[1:])\n if a[0] > newmax:\n return a[0]\n else:\n return newmax","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":15246,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 14:01:47","func_code":"def maximum(a):\n minim = None\n if len(a) == 1:\n return a[0]\n newmax = maximum(a[1:])\n if a[0] > newmax:\n return a[0]\n else:\n return newmax","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":27616,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 14:01:58","func_code":"def minimum(l):\n l = sorted(l)\n if len(l) == 1:\n return l[0]\n l.pop()\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":38059,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 14:01:58","func_code":"def minimum(l):\n l = sorted(l)\n if len(l) == 1:\n return l[0]\n l.pop()\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":29486,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:02:08","func_code":"def factorial(n):\n if n == 0:\n return 1\n fact_of_n = n - 1\n return n * fact_of_n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":5781,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:02:18","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":68,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:02:18","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":39903,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 14:02:19","func_code":"def reverse_list(l):\n x = []\n i = len(l) - 1\n while i != -1:\n x.append(l[i])\n i -= 1\n return x","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":28423,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 14:02:19","func_code":"def reverse_list(l):\n x = []\n i = len(l) - 1\n while i != -1:\n x.append(l[i])\n i -= 1\n return x","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":37334,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:02:26","func_code":"def sumup(n):\n if n == 0:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":37208,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:02:27","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n fact_of_n = n - 1\n return n * fact_of_n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":10514,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:02:43","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":35921,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:02:43","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":37872,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:02:47","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + (n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":20989,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:02:50","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":28425,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:02:50","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":3440,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:02:53","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":20612,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:02:53","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":20511,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:03:02","func_code":"def factorial(n):\n if n == 0:\n return 1\n fact_of_n = n - 1\n return n * fact_of_n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":27883,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:03:11","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":36323,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:03:11","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":6235,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 14:03:13","func_code":"def maximum(l):\n l = sorted(l, reverse=True)\n if len(l) == 1:\n return l[0]\n l.pop()\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":39947,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 14:03:13","func_code":"def maximum(l):\n l = sorted(l, reverse=True)\n if len(l) == 1:\n return l[0]\n l.pop()\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":37109,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:03:28","func_code":"def sumup(n):\n total = 0\n for i in range(n):\n total + i\n return total + n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":15541,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:03:57","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":38065,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:03:57","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7559,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:03:58","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":21857,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:04:03","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":34368,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:04:06","func_code":"def factorial(n):\n if n == 0:\n return 1\n fact_of_n = factorial(n - 1)\n return n * (n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":11173,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:04:16","func_code":"def factorial(n):\n if n == 0:\n return 1\n fact_of_n = factorial(n - 1)\n return n * (n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12053,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:04:24","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":40864,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:04:32","func_code":"def factorial(n):\n if n == 0:\n return 1\n fact_of_n = factorial(n - 1)\n return n * fact_of_n(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":29435,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:04:37","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":11396,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:04:44","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sum_up_to(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":40190,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:04:45","func_code":"def factorial(n):\n if n == 0:\n return 1\n fact_of_n = factorial(n - 1)\n return n * fact_of_n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12763,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:04:45","func_code":"def factorial(n):\n if n == 0:\n return 1\n fact_of_n = factorial(n - 1)\n return n * fact_of_n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":26110,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:04:49","func_code":"def sumup(n):\n if n == 1:\n return 1\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":960,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:04:49","func_code":"def sumup(n):\n if n == 1:\n return 1\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":12953,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:04:53","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":39008,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:04:53","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":30162,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:04:56","func_code":"def sumup(n):\n if n == 1:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":24057,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:04:59","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":17103,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:04:59","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":39166,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:05:02","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22051,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:05:02","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40556,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:05:02","func_code":"def sumup(n):\n if n == 1:\n return 1\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":5033,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:05:14","func_code":"def sumup(n):\n if n == 0:\n return 0\n total = 0\n for i in range(0, n):\n total + i\n return sumup(n - 1) + n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":22351,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:05:14","func_code":"def sumup(n):\n if n == 0:\n return 0\n total = 0\n for i in range(0, n):\n total + i\n return sumup(n - 1) + n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":28741,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 14:05:15","func_code":"def factorial(n):\n if n == 0:\n return 1\n facotrial_n_minus_1 = factorial(n - 1)\n return n * facotrial_n_minus_1","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36648,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 14:05:15","func_code":"def factorial(n):\n if n == 0:\n return 1\n facotrial_n_minus_1 = factorial(n - 1)\n return n * facotrial_n_minus_1","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":31688,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:05:27","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":22212,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:05:27","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":6876,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 14:05:30","func_code":"def power(n, p):\n return n ** p","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":39393,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:05:34","func_code":"def factorial(n):\n if n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":1405,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:05:45","func_code":"def factorial(n):\n if n == 0:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":9584,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:05:47","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":32268,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:05:48","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":38291,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:05:48","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":5706,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:05:56","func_code":"def factorial(n):\n if n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40968,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:06:02","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":26627,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:06:23","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n for i in s:\n if s.isalpha():\n total += 1\n return total","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":39028,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:06:24","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":29001,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:06:44","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":17808,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:06:44","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40429,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:07:13","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":18163,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:07:17","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":9241,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:07:22","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":5829,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:07:29","func_code":"def sumup(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":15142,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 14:07:34","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":14346,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 14:07:34","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":38269,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:07:36","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":38066,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:07:38","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":36651,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:07:38","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":5538,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:07:40","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":821,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:07:40","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41190,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:07:45","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":17828,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:07:54","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":27686,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:07:54","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":39156,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:07:54","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":28097,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:08:02","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":14129,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:08:02","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":13182,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:08:15","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":35859,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:08:15","func_code":"def factorial(n):\n if n == 0:\n return 0\n total = 1\n for i in range(n):\n total *= i\n return factorial(n - 1) * n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14062,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:08:25","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n + 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":26806,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:08:25","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 0:\n return 0\n power_of_n = power(n - 1)\n return power_of_n ** m","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":40772,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:08:50","func_code":"def factorial(n):\n if n == 0:\n return 1\n total = 1\n for i in range(0, n):\n total *= i\n return factorial(n - 1) * n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41304,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:08:50","func_code":"def factorial(n):\n if n == 0:\n return 1\n total = 1\n for i in range(0, n):\n total *= i\n return factorial(n - 1) * n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":32618,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 14:08:51","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":38377,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 14:08:51","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":14629,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:08:54","func_code":"def factorial(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":21424,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:08:55","func_code":"def sumup(n):\n return n if n < 2 else n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":35951,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:08:55","func_code":"def sumup(n):\n return n if n < 2 else n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":39822,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:08:57","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 0:\n return 0\n power_of_m = power(n - 1)\n return power_of_m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":2585,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-03 14:09:00","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":19045,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-03 14:09:00","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":18688,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:09:03","func_code":"def factorial(n):\n if n == 1:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24733,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:09:08","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":10120,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:09:08","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24946,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:09:14","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":13679,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:09:14","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":26996,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 14:09:26","func_code":"def power(m, n):\n if n == 0:\n return 1\n power_n_minus_1 = power(m, n - 1)\n return m * power_n_minus_1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":33359,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 14:09:26","func_code":"def power(m, n):\n if n == 0:\n return 1\n power_n_minus_1 = power(m, n - 1)\n return m * power_n_minus_1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":24359,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:09:28","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23358,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 14:09:32","func_code":"def count_letters(s):\n if not s:\n return 0\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":38781,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 14:09:32","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36719,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 14:09:32","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12325,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:09:34","func_code":"def factorial(n):\n if n == 1:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24493,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:09:35","func_code":"def power(a, b):\n if a ** b == 0:\n return 1\n return power(a ** b)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":13968,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:09:47","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23586,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:09:47","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":9346,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:10:15","func_code":"def factorial(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":37121,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:10:16","func_code":"def factorial(n):\n return n if n < 2 else n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":30753,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:10:21","func_code":"def power(m, n):\n if m == 0 or n == 0:\n return 1\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17375,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:10:21","func_code":"def power(m, n):\n if m == 0 or n == 0:\n return 1\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":12885,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:10:26","func_code":"def power(a, b):\n if a ** b == 0:\n return 1\n else:\n return a ** b\n return power(a, b)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":15506,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:10:26","func_code":"def power(a, b):\n if a ** b == 0:\n return 1\n else:\n return a ** b\n return power(a, b)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":40279,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:10:27","func_code":"def factorial(n):\n return 1 if n < 2 else n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":17910,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:10:27","func_code":"def factorial(n):\n return 1 if n < 2 else n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":36953,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:10:35","func_code":"def factorial(n):\n if n == 1:\n return 1\n elif n == 0:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":1600,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:10:35","func_code":"def factorial(n):\n if n == 1:\n return 1\n elif n == 0:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":33434,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 14:10:40","func_code":"def count_letters(s):\n if not s:\n return 0\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":31087,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 14:10:40","func_code":"def count_letters(s):\n if not s:\n return 0\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":21260,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 14:10:44","func_code":"def sumup(n):\n if n == 1:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":19009,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:10:46","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20312,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 14:11:04","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":29948,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 14:11:04","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32337,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:11:10","func_code":"def power(m, n):\n if n == 0:\n return 1\n return power(m, n - 1) * m","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":41369,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:11:10","func_code":"def power(m, n):\n if n == 0 or m == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":28802,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:11:10","func_code":"def power(m, n):\n if n == 0 or m == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32428,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:11:10","func_code":"def power(m, n):\n if n == 0:\n return 1\n return power(m, n - 1) * m","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":33729,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 14:11:15","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":33752,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 14:11:15","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":22228,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:11:20","func_code":"def power(n, m):\n if n == 2 and m == 3:\n return 8\n return n ** power(n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":42209,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:11:26","func_code":"def power(m, n):\n if n == 0:\n return 1\n return power(m, n - 1) * m","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":27768,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:11:26","func_code":"def power(m, n):\n if n == 0:\n return 1\n return power(m, n - 1) * m","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19732,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 14:11:43","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23420,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 14:11:43","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":8713,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:11:50","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":29170,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:11:50","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":22558,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:11:57","func_code":"def power(n, m):\n return 1 if not m else n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":27454,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:11:58","func_code":"def power(a, b):\n return a ** b","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":40314,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 14:11:59","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":23177,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:12:04","func_code":"def sumup(n):\n if n == 1:\n return 1\n return sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":24247,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:12:08","func_code":"def power(n, m):\n return 1 if not m else n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":9918,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:12:08","func_code":"def power(n, m):\n return 1 if not m else n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":38285,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 14:12:30","func_code":"def power(n, m):\n return n ** m","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":4572,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 14:13:18","func_code":"def sumup(n):\n if n == 1:\n return 1\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":30615,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:13:24","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22487,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:13:24","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":9747,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:13:26","func_code":"def power(n, m):\n if n == 2 and m == 3:\n return 8\n return n ** power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":14069,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:13:31","func_code":"def minimum(A, p, r):\n q = j = p\n while j < r:\n if A[j] <= A[r]:\n A[q], A[j] = A[j], A[q]\n q += 1\n j += 1\n A[q], A[r] = A[r], A[q]\n return q","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":4081,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:13:45","func_code":"def sumup(n):\n if n == 1:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":26557,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:13:57","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":40105,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:13:59","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 0:\n return 0\n power_of_n = power(n - 1)\n return m ** power_of_n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":37328,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:14:04","func_code":"def reverse_list(l=[]):\n if l.isempty():\n return '[]'\n for i in reversed(l):\n return list(i)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":33539,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:14:09","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":35788,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:14:09","func_code":"def minimum(n):\n print(n)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":31899,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:14:09","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":40430,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:14:15","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":23467,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:14:15","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":20349,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 14:14:20","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":9892,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 14:14:20","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":14242,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:14:24","func_code":"def power(m, n):\n if n == 0:\n return 1\n total = m ** (n - 1)\n return total + m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":21884,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 14:14:28","func_code":"def reverse_list(a):\n if len(a) == 1:\n return [a[0]]\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":14607,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:14:46","func_code":"def minimum(l):\n l = sorted(l)\n if l[0] < l[1]:\n return l[0]\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":36014,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:14:56","func_code":"def power(m, n):\n if n == 0:\n return 1\n total = m ** (n - 2)\n return total + m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":11985,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:15:11","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":2995,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 14:15:24","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n elif len(a) == 1:\n return [a[0]]\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":18559,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 14:15:24","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n elif len(a) == 1:\n return [a[0]]\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":11304,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:15:29","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":4230,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:15:29","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22060,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:15:44","func_code":"def minimum(l):\n return l[0] if len(l) == 1 else min(l[0], minimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":642,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:15:45","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return l\n for i in reversed(l):\n return list(i)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":8970,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:15:46","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 0:\n return 0\n a = power(m - 1, n - 1)\n return m ** power_of_n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":19296,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:15:48","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":16609,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:15:48","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":42238,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:15:50","func_code":"def power(m, n):\n if m == 1:\n return m\n return power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":14984,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:15:51","func_code":"def power(m, n):\n if n == 0:\n return 1\n total = m ** (n - 2)\n return power(m, n - 1) + m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":4461,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:15:54","func_code":"def power(n, m):\n if n == 0 and m == 0:\n return 8\n return n ** power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":28661,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:15:54","func_code":"def minimum(l):\n return l[0] if len(l) == 1 else min(l[0], minimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12255,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:16:12","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":6336,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:16:22","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":793,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:16:22","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":37588,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:16:27","func_code":"def power(m, n):\n if n == 0:\n return 1\n if m == 0:\n return 0\n total = m ** (n - 2)\n return power(m, n - 1) + m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":7424,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:16:46","func_code":"def power(n, m):\n if n == 0 and m == 0:\n return 1\n return n ** power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":34296,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:16:56","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 0:\n return 0\n power_n = power(m - 1, n - 1)\n return power_m ** power_n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":14390,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:17:04","func_code":"def maximum(l):\n return l[0] if len(l) == 1 else max(l[0], maximum(l[1:]))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":3325,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:17:09","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 0:\n return 0\n power_n = power(m - 1, n - 1)\n return m ** power_n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":10595,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:17:11","func_code":"def power(m, n):\n if n == 0:\n return 1\n if m == 0:\n return 0\n total = m ** (n - 1)\n return power(m, n - 1) + m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":5941,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 14:17:27","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":8520,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:17:31","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return l\n x = []\n for i in reversed(l):\n x.append(i)\n return x","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":23648,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:17:35","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":6324,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:17:44","func_code":"def power(m, n):\n if m == 1:\n return m\n return power(n ** m, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":9766,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:17:46","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":10239,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:17:46","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40804,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:17:51","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":1543,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:17:51","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":14237,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:18:03","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":399,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:18:10","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":4022,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 14:18:10","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":13372,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:18:10","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":13219,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 14:18:10","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":10017,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:18:13","func_code":"def maximum(l):\n sorted(l)\n return l(len(l) - 1)\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":639,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:18:26","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 0:\n return 0\n b = power(n - 1)\n return m ** b","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":30504,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:18:29","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":7243,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:18:29","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":24871,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 14:18:30","func_code":"def power(m, n):\n if n == 1:\n return m\n elif n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19765,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 14:18:30","func_code":"def power(m, n):\n if n == 1:\n return m\n elif n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":13722,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:18:32","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":17040,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:18:44","func_code":"def power(m, n):\n if n == 0:\n return 1\n if m == 0:\n return 0\n total = m ** (n - 1)\n return power(m, n - 1) + m ** (n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":26673,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:18:47","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":18397,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:18:47","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":40377,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:18:51","func_code":"def count_letters(s):\n return 0 if not s else count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":25009,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:18:51","func_code":"def count_letters(s):\n return 0 if not s else count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":14087,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:19:09","func_code":"def maximum(l):\n l = sorted(l)\n if l[len(l) - 1] > l[len(l) - 2]:\n return l[0]\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":5206,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:19:09","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":7583,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:19:23","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":378,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:19:23","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":11685,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:19:29","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":9072,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:19:31","func_code":"def maximum(l):\n l = sorted(l)\n if l[len(l) - 1] > l[len(l) - 2]:\n return l[len(l) - 1]\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":23641,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:19:31","func_code":"def maximum(l):\n l = sorted(l)\n if l[len(l) - 1] > l[len(l) - 2]:\n return l[len(l) - 1]\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":26891,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:19:32","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n + factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":800,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:19:36","func_code":"def factorial(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":35971,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:19:42","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sum_up_to(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":9448,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:19:46","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n + factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40861,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:19:47","func_code":"def sumup(n):\n if n == 1:\n return 1\n n = n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":32008,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:19:57","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 0:\n return 0\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":24346,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:19:57","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 0:\n return 0\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":27308,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:20:00","func_code":"def sumup(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":17571,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:20:00","func_code":"def sumup(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":25250,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:20:02","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":24357,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:20:02","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":15832,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:20:03","func_code":"def factorial(n):\n if n == 0:\n return 0\n elif n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":33440,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:20:05","func_code":"def reverse_list(l):\n return l if len(l) == 1 else reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":42050,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:20:13","func_code":"def sumup(n):\n if n == 0:\n return 0\n n = n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":17415,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:20:17","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":13055,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:20:19","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":32591,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:20:19","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":2806,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:20:20","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":4503,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:20:20","func_code":"def power(a, b):\n if b == 0:\n return 1\n return a * power(a, b - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":12649,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:20:20","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":19847,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:20:20","func_code":"def power(a, b):\n if b == 0:\n return 1\n return a * power(a, b - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":20590,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 14:20:29","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":38515,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 14:20:29","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":8572,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:20:31","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":16556,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:20:32","func_code":"def sumup(n):\n if n == 0:\n return 0\n n = n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":9332,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:20:41","func_code":"def reverse_list(l):\n if len(l) < 2:\n return l\n else:\n return reverse_list(l[1:]) + l[0]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":26651,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:20:51","func_code":"def reverse_list(l):\n if len(l) < 2:\n return l\n else:\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":7127,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:21:03","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":1,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:21:06","func_code":"def reverse_list(l):\n return l if len(l) < 2 else reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":13681,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:21:06","func_code":"def reverse_list(l):\n return l if len(l) < 2 else reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":4196,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:21:10","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":38425,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:21:10","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":25398,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 14:21:19","func_code":"def fibonacci(n):\n i = 0\n prev = 0\n curr = 1\n while i < n:\n total = curr + prev\n prev = curr\n curr = total\n i += 1\n return curr","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23486,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 14:21:19","func_code":"def fibonacci(n):\n i = 0\n prev = 0\n curr = 1\n while i < n:\n total = curr + prev\n prev = curr\n curr = total\n i += 1\n return curr","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8374,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-03 14:21:19","func_code":"def fibonacci(n):\n i = 0\n prev = 0\n curr = 1\n while i < n:\n total = curr + prev\n prev = curr\n curr = total\n i += 1\n return curr","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22269,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 14:21:24","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] >= maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":11919,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 14:21:24","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] >= maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":14705,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:21:47","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":7823,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:21:47","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":14252,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:21:50","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":8442,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:21:50","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":33954,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:21:51","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n ** p","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":324,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:21:55","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":21223,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:21:55","func_code":"def minimum(l=[]):\n if len(l) == 0:\n return l\n lowest = 0\n for i in l:\n if i > lowest:\n lowest = i\n return lowest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":22496,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:21:55","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":25393,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:22:09","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23952,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:22:11","func_code":"def fibonacci(n):\n return 1 if n < 2 else fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20327,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:22:11","func_code":"def fibonacci(n):\n return 1 if n < 2 else fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1746,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:22:15","func_code":"def factorial(n):\n if n * n == 1:\n return 1\n if n * n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":4399,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:22:15","func_code":"def factorial(n):\n if n * n == 1:\n return 1\n if n * n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":34241,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:22:37","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20751,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:22:42","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":2945,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 14:22:46","func_code":"def count_letters(s):\n global count\n count += 1\n if not s:\n return count\n s = s[:-1]\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":12366,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:22:51","func_code":"def minimum(n):\n print(min(n))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":10751,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:22:52","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":27522,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:22:57","func_code":"def count_letters(n):\n total = 0\n for char in n:\n total += 1\n return count_letters(n)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":5619,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-03 14:23:05","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41196,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:23:05","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":11257,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:23:05","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":9667,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-03 14:23:05","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40686,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:23:07","func_code":"def minimum(n):\n n = n.strip()\n print(min(n))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":3750,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:23:26","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":33420,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:23:26","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":35179,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:23:30","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":25879,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:23:30","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17977,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:23:38","func_code":"def sumup(n):\n if n == 1:\n return 1\n sumup = sumup(n - 1)\n return n + sumup","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":4714,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 14:23:41","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":39506,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 14:23:41","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":33831,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:23:49","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":13545,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:23:52","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":11110,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:23:52","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":33982,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:23:59","func_code":"def minimum(l=[]):\n if len(l) == 0:\n return l\n lowest = 0\n for i in range(1, len(l)):\n if i > lowest:\n lowest = i\n return lowest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":42126,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:24:00","func_code":"def minimum(n):\n if min(n) != None:\n print(min(n))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":40882,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:24:05","func_code":"def power(m, n):\n if m ** n == 1:\n return 1\n if m ** n == 1:\n return 1\n return m ** m ** (n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":40140,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:24:07","func_code":"def power(m, n):\n if n == 0:\n return 1\n return power(m ** n)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":13781,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:24:29","func_code":"def minimum(n):\n if n != None:\n print(min(n))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":32833,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:24:30","func_code":"def power(m, n):\n if m ** n == 1:\n return 1\n if m ** n == 1:\n return 1\n return m ** power(m ** (n - 1))","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":5332,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:24:30","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":9507,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:24:30","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":19358,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:24:39","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n + 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":35581,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:24:45","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n - sum(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":2542,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:25:03","func_code":"def power(m, n):\n if n == 0:\n return n\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":40793,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:25:11","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23430,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:25:13","func_code":"def factorial(n):\n if n <= 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":17872,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:25:13","func_code":"def factorial(n):\n if n <= 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":20614,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:25:17","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":3041,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:25:17","func_code":"def factorial(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36493,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:25:17","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":28334,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:25:26","func_code":"def factorial(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n * factorial(n + 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":11925,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:25:27","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":13150,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:25:27","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":26000,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:25:28","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sum(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":15807,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:25:32","func_code":"def minimum(l=[]):\n if len(l) == 0:\n return l\n lowest = 0\n i = 0\n while i < len(l):\n if i > lowest:\n lowest = i\n return lowest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":27026,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-03 14:25:33","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":35923,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-03 14:25:33","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":9705,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:25:35","func_code":"def sumup(n):\n if n == 1:\n return 0\n sumup = sumup(n - 1)\n return n + sumup","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":11901,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 14:25:36","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":29574,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 14:25:36","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":6586,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 14:25:39","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41741,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 14:25:39","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":5178,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:25:40","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24347,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:25:40","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":27153,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 14:25:41","func_code":"def count_letters(s):\n if not s:\n return count_letters.count\n s = s[:-1]\n count_letters.count += 1\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":23573,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:25:46","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":15173,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:25:46","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":28832,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:25:58","func_code":"def power(m, n):\n if m ** n == 1:\n return 1\n if m ** n == 0:\n return 1\n return m ** power(m ** (n - 1))","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":17468,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:26:08","func_code":"def sumup(n):\n if n == 0:\n return 0\n sumup = sumup(n - 1)\n return n + sumup","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":6478,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:26:29","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n sumup = sumup(n - 1)\n return n + sumup","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":7185,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:26:32","func_code":"def sumup(n):\n if not n:\n return n\n if n == 1:\n return 1\n return n + sum(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":9823,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:26:47","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * sumup(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":10706,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:26:56","func_code":"def power(n, x):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n * factorial(x - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":15829,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:27:07","func_code":"def power(n, x):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n * power(x - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":23065,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:27:09","func_code":"def power(m, n):\n if m == 0:\n return m\n return m + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":27008,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:27:13","func_code":"def sumup(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":29253,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:27:13","func_code":"def sumup(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":30317,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:27:21","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14938,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:27:21","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36509,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-03 14:27:23","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n + factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":34975,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:27:52","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":12733,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:27:52","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17146,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:27:54","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":39265,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:28:03","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":39637,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:28:03","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":30756,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-03 14:28:04","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":25894,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:28:06","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32652,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:28:06","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":26274,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:28:16","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n * sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":17144,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:28:22","func_code":"def power(m, n):\n if m == 0:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":31584,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:28:32","func_code":"def power(n, m):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n * power(m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":31017,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:28:46","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n small = a[0]\n i = 0\n if a[i + 1] < small:\n small = a[i]\n else:\n a.remove(a[i])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":30728,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:28:46","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n * sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":18019,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:28:53","func_code":"def power(n, m):\n print((n, m))","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":14225,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:28:54","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":26751,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:28:54","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":17445,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:29:07","func_code":"def power(m, n):\n if m == 0:\n return 1\n if n == 0:\n return 1\n return m ** power(n)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":21775,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:29:20","func_code":"def minimum(l=[]):\n if len(l) == 0:\n return l\n lowest = 0\n for i in l:\n if i < lowest:\n i = lowest\n return lowest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":6942,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 14:29:20","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":40633,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 14:29:20","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":25455,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:29:29","func_code":"def factorial(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40897,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:29:32","func_code":"def minimum(l=[]):\n if len(l) == 0:\n return l\n lowest = 0\n for i in l:\n if i > lowest:\n i = lowest\n return lowest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":23965,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:29:44","func_code":"def minimum(l=[]):\n if len(l) == 0:\n return l\n lowest = 0\n for i in l:\n if i > lowest:\n lowest = i\n return lowest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":34266,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:29:46","func_code":"def power(n, m):\n if n == 0:\n return 1\n return n * power(m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":20722,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:29:50","func_code":"def power(m, n):\n if n == 0:\n return 1\n return n ** power(m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":40160,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:30:00","func_code":"def minimum(n):\n if n != None:\n print(min(n))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":29914,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:30:06","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23325,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:30:06","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":13220,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-03 14:30:08","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n + 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14343,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-03 14:30:08","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n + 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23493,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-03 14:30:08","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n + 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":33969,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:30:14","func_code":"def power(m, n):\n if n == 0:\n return 1\n return n ** power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":33722,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:30:15","func_code":"def power(a, b):\n if b == 0:\n return 1\n return a * power(a, b - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":5968,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:30:15","func_code":"def power(a, b):\n if b == 0:\n return 1\n return a * power(a, b - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":7226,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:30:24","func_code":"def power(n, m):\n if n == 0:\n return 1\n return n * power(m, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":38979,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:30:36","func_code":"def power(n, m):\n if n == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":26071,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 14:30:38","func_code":"def minimum(line):\n smallest = line[0]\n for c in line:\n if c < smallest:\n smallest = c\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":17258,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 14:30:38","func_code":"def minimum(line):\n smallest = line[0]\n for c in line:\n if c < smallest:\n smallest = c\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":31818,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:30:46","func_code":"def power(m, n):\n if n == 0:\n return 1\n return n * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":15238,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:31:12","func_code":"def power(m, n):\n if n == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":19432,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:31:22","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return min(l[0], findMinimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":18417,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:31:33","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":26409,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 14:31:33","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":24960,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:31:40","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n small = a[0]\n if a[1] < small:\n small = a[1]\n else:\n a.remove(a[0])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":10549,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:31:47","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return min(l[0], minimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":32989,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:31:47","func_code":"def minimum(l=[]):\n if len(l) == 0:\n return l\n lowest = 0\n i = 0\n j = i + 1\n while i < len(l):\n if i < j[i]:\n j[i] = i\n return i","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":38394,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:32:00","func_code":"def power(n, m):\n if n == 0:\n return 1\n return n * power(m, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":31302,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:32:05","func_code":"def power(n, p):\n if p == 0:\n return 1\n if p == 1:\n return n\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":34137,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:32:05","func_code":"def power(n, p):\n if p == 0:\n return 1\n if p == 1:\n return n\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":14496,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:32:13","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[-2] < a[-1]:\n return minimum(a[:-1])\n else:\n return minimum(a[:-2] + a[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":9774,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:32:13","func_code":"def power(n, p):\n if p == 0:\n return 1\n power = power(p - 1)\n return power * n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":2694,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:32:31","func_code":"def power(n, m):\n if n == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":9854,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:32:32","func_code":"def power(n, p):\n if p == 0:\n return 1\n po = power(p - 1)\n return po * n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":28562,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 14:32:34","func_code":"def power(n, p):\n if p == 1:\n return n\n return n * n ** (p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":36017,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:32:44","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":11510,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:32:44","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":29362,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-03 14:32:59","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":11606,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-03 14:32:59","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":3273,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 14:33:00","func_code":"def power(n, p):\n if p == 1:\n return n\n return int(n * n ** (p - 1))","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":4958,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 14:33:00","func_code":"def power(n, p):\n if p == 1:\n return n\n return int(n * n ** (p - 1))","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":28798,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:33:04","func_code":"def power(m, n):\n if n == 0:\n return 0\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":1307,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:33:16","func_code":"def power(m, n):\n if n == 0:\n return 8\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":7909,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:33:22","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n m = minimum(n[1:])\n return n[0] if n[0] < m else m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":31152,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:33:23","func_code":"def power(n, p):\n if n == 0:\n return 1\n return n ** p","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32364,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:33:26","func_code":"def power(m, n):\n if n == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":26989,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 14:33:31","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":8568,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 14:33:31","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":16579,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:33:38","func_code":"def power(m, n):\n if n == 0:\n return 1\n return n ** power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":12891,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:33:50","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n ** p","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":26377,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:33:54","func_code":"def power(m, n):\n if n == 0:\n return 1\n return n * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":33910,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 14:33:55","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":36308,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:34:05","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12965,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:34:05","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":28602,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 14:34:11","func_code":"def power(n, m):\n if m == 0:\n return m + 1\n if m > 0:\n return n ** m\n return power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":27926,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 14:34:13","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":9603,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:34:22","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n return n[0] if n[0] < minimum(n[1:]) else minimum(n[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":35459,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:34:22","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n return n[0] if n[0] < minimum(n[1:]) else minimum(n[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":15932,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 14:34:39","func_code":"def count_letters(s):\n if not s:\n return count_letters.count\n s = s[:-1]\n count_letters.count += 1\n try:\n return count_letters(s)\n finally:\n count_letters.count = 0","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":5818,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 14:34:39","func_code":"def count_letters(s):\n if not s:\n return count_letters.count\n s = s[:-1]\n count_letters.count += 1\n try:\n return count_letters(s)\n finally:\n count_letters.count = 0","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":12511,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:34:40","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n small = a[0]\n if a[1] < small:\n small = a[1]\n else:\n a.remove(a[0])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":3535,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:35:13","func_code":"def minimum(n):\n if len(n) == 1:\n print(n[0])\n if l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":11625,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:35:15","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if a[-2] < a[-1]:\n return minimum(a[:-1])\n else:\n return minimum(a[:-2] + a[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":1423,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:35:17","func_code":"def minimum(l):\n try:\n if l[0] < l[1]:\n return minimum(l[:1] + l[2:])\n else:\n return minimum(l[1:])\n except IndexError:\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":35543,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:35:20","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n return n[0] if n[0] > maximum(n[1:]) else maximum(n[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":4796,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:35:20","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n return n[0] if n[0] > maximum(n[1:]) else maximum(n[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":36205,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:35:28","func_code":"def minimum(n):\n i = 0\n while i < n:\n i = i + 1\n return i","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":28440,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 14:35:29","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":18728,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 14:35:29","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":22547,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:35:35","func_code":"def power(n, p):\n if p == 0:\n return 1\n elif p == 1:\n return n\n return n ** (p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":4906,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:35:43","func_code":"def minimum(l=[]):\n print('1\\n3\\n6\\n4')","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":5276,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:35:45","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] < l[-1]:\n return minimum(l[:-1])\n else:\n return minimum(l[:-2] + l[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":33249,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:35:45","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] < l[-1]:\n return minimum(l[:-1])\n else:\n return minimum(l[:-2] + l[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":39841,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:35:49","func_code":"def minimum(l):\n if len(l) == 1:\n print(l[0])\n if l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":24784,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:35:56","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[-2] > a[-1]:\n return minimum(a[:-1])\n else:\n return minimum(a[:-2] + a[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":21725,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:36:00","func_code":"def minimum(l):\n print('1\\n3\\n6\\n4')","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":33197,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:36:04","func_code":"def minimum(l):\n try:\n if l[0] < l[1]:\n return minimum(l[:1] + l[2:])\n else:\n return minimum(l[1:])\n except IndexError:\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":11943,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:36:04","func_code":"def minimum(l):\n try:\n if l[0] < l[1]:\n return minimum(l[:1] + l[2:])\n else:\n return minimum(l[1:])\n except IndexError:\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":21339,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:36:08","func_code":"def power(n, p):\n if p == 0:\n return 1\n elif p == 1:\n return n\n return n ** power(n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":15617,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:36:15","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":39087,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:36:15","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":35668,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:36:22","func_code":"def power(n, p):\n if p == 0:\n return 1\n elif p == 1:\n return n\n return n ** power(n - 1, p)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":32076,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:36:29","func_code":"def minimum(k):\n if len(k) == 1:\n return k[0]\n if k[0] < minimum(k[1:]):\n return k[0]\n else:\n return minimum(k[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":34825,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:36:29","func_code":"def minimum(k):\n if len(k) == 1:\n return k[0]\n if k[0] < minimum(k[1:]):\n return k[0]\n else:\n return minimum(k[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":4229,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 14:36:32","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":14199,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 14:36:32","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":24758,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:36:39","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17034,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:36:39","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[-2] > a[-1]:\n return maximum(a[:-1])\n else:\n return maximum(a[:-2] + a[-1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":31054,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:36:39","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":16363,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:36:39","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[-2] > a[-1]:\n return maximum(a[:-1])\n else:\n return maximum(a[:-2] + a[-1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":7449,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:36:41","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":35947,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:36:41","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":41210,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:36:44","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":11987,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:36:44","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":14750,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:36:58","func_code":"def power(n, p):\n if p == 0:\n return 1\n elif p == 1:\n return n\n return n ** power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":14791,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:37:05","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] > l[-1]:\n return maximum(l[:-1])\n else:\n return maximum(l[:-2] + l[-1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":15072,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:37:05","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n m = minimum(n[1:])\n return n[0] if n[0] < m else m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":10295,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:37:05","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n m = minimum(n[1:])\n return n[0] if n[0] < m else m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":5514,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:37:05","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] > l[-1]:\n return maximum(l[:-1])\n else:\n return maximum(l[:-2] + l[-1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":1326,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 14:37:06","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":25302,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 14:37:06","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":37098,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:37:07","func_code":"def maximum(l):\n try:\n if l[0] > l[1]:\n return maximum(l[:1] + l[2:])\n else:\n return maximum(l[1:])\n except IndexError:\n return l[0]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":8394,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:37:07","func_code":"def maximum(l):\n try:\n if l[0] > l[1]:\n return maximum(l[:1] + l[2:])\n else:\n return maximum(l[1:])\n except IndexError:\n return l[0]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":33607,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 14:37:08","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorila(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":1579,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:37:09","func_code":"def power(n, p):\n if p == 0:\n return 1\n elif p == 1:\n return n\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19826,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:37:09","func_code":"def power(n, p):\n if p == 0:\n return 1\n elif p == 1:\n return n\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":736,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:37:11","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[-2] > a[-1]:\n return minimum(a[:-1])\n else:\n return minimum(a[:-2] + a[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":30842,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:37:27","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n n, m = l[0], maximum(l[1:])\n return n if n > m else m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":16293,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:37:27","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n n, m = l[0], maximum(l[1:])\n return n if n > m else m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":917,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:37:31","func_code":"def maximum(k):\n if len(k) == 1:\n return k[0]\n if k[0] > maximum(k[1:]):\n return k[0]\n else:\n return maximum(k[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":34105,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:37:31","func_code":"def maximum(k):\n if len(k) == 1:\n return k[0]\n if k[0] > maximum(k[1:]):\n return k[0]\n else:\n return maximum(k[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":9405,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:37:32","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n n, m = l[0], minimum(l[1:])\n return n if n < m else m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":38027,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:37:32","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n n, m = l[0], minimum(l[1:])\n return n if n < m else m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":10864,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-04-03 14:37:32","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n n, m = l[0], minimum(l[1:])\n return n if n < m else m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":5554,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 14:38:10","func_code":"def factorial(n):\n if n <= 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":6449,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 14:38:10","func_code":"def factorial(n):\n if n <= 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":5356,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:38:30","func_code":"def minimum(n):\n if len(n) == 1:\n return n\n if n[0] > minimum(n[1:]):\n return n\n else:\n return minimum(n - 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":31164,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:39:12","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] > l[-1]:\n return minimum(l[:-1])\n else:\n return minimum(L[:-2] + l[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":37371,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:39:24","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] > l[-1]:\n return minimum(l[:-1])\n else:\n return minimum(l[:-2] + l[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":9478,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:39:30","func_code":"def count_letters(s):\n if s == '':\n return 0\n count = count_letters(s[:-1])\n return len(s) + count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":22320,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:39:37","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] < l[-1]:\n return minimum(l[:-1])\n else:\n return minimum(l[:-2] + l[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":17198,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:39:37","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] < l[-1]:\n return minimum(l[:-1])\n else:\n return minimum(l[:-2] + l[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":32177,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 14:39:57","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":27029,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 14:39:57","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32335,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:40:30","func_code":"def count_letters(s):\n if s == '':\n return 0\n length = count_letters(s[:-1])\n count += 1\n if length == 0:\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":35629,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 14:40:31","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":1429,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 14:40:31","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":20675,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:40:39","func_code":"def power(n, m):\n if n == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":10221,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:40:49","func_code":"def count_letters(s):\n if s == '':\n return 0\n length = count_letters(s[:-1])\n count += 1\n if length == 0:\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":20493,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 14:40:51","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":28503,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 14:40:51","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32434,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:41:00","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n small = a[0]\n if a[1] < small:\n small = a[1]\n a.remove(a[0])\n else:\n a.remove(a[1])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":14812,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:41:00","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n small = a[0]\n if a[1] < small:\n small = a[1]\n a.remove(a[0])\n else:\n a.remove(a[1])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":40513,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:41:09","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":23874,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:41:09","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":34144,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:41:19","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = minimum(l[1:])\n if l[0] < nl:\n return l[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":24035,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:41:19","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = minimum(l[1:])\n if l[0] < nl:\n return l[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12928,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:41:25","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n smallest = minimum(l[1:])\n if l[0] < smallest:\n return l[0]\n else:\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":33005,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:41:25","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n smallest = minimum(l[1:])\n if l[0] < smallest:\n return l[0]\n else:\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":25887,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 14:41:39","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorila(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41818,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 14:41:54","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40277,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 14:41:54","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":3384,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:42:15","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = minimum(l[1:])\n if l[0] < nl:\n return l[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":8285,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:42:15","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = minimum(l[1:])\n if l[0] < nl:\n return l[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":17383,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:42:20","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return 0\n length = count_letters(s[:-1])\n count += 1\n if length == 0:\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":16483,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:42:22","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > minimum(a[1:]):\n return a[0]\n else:\n return minimum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":27677,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:42:25","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":31019,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:42:25","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = minimum(l[1:])\n if l[0] < nl:\n return l[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":22842,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:42:25","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = minimum(l[1:])\n if l[0] < nl:\n return l[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":42448,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 14:42:25","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":27536,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 14:42:26","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":19024,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 14:42:26","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":10082,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:42:26","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[-2] > a[-1]:\n return minimum(a[:-1])\n else:\n return minimum(a[:-2] + a[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":1803,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:42:32","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = minimum(l[1:])\n if l[0] < nl:\n return l[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":2299,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:42:32","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = minimum(l[1:])\n if l[0] < nl:\n return l[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":4707,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:42:33","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = maximum(l[1:])\n if l[0] > nl:\n return l[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":8894,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:42:33","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = maximum(l[1:])\n if l[0] > nl:\n return l[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":35753,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 14:42:37","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[-2] < a[-1]:\n return minimum(a[:-1])\n else:\n return minimum(a[:-2] + a[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":40749,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:42:39","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n biggest = maximum(l[1:])\n if l[0] > biggest:\n return l[0]\n else:\n return biggest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":28139,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:42:39","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n biggest = maximum(l[1:])\n if l[0] > biggest:\n return l[0]\n else:\n return biggest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":37055,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:42:44","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return 0\n length = count_letters(s[:-1])\n count = count + 1\n if length == 0:\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":24507,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:42:49","func_code":"def power(m, n):\n if m == 0:\n return 1\n return n * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":28800,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:42:50","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] < minimum(a[1:]):\n return a[0]\n else:\n return minimum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":24987,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:42:50","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] < minimum(a[1:]):\n return a[0]\n else:\n return minimum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":3536,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 14:42:57","func_code":"def power(m, n):\n if n == 1:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":29886,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:42:58","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = maximum(l[1:])\n if l[0] > nl:\n return l[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":18743,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:43:03","func_code":"def power(m, n):\n if m == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":32486,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:43:06","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = maximum(l[1:])\n if l[0] > nl:\n return l[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":14662,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:43:06","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = maximum(l[1:])\n if l[0] > nl:\n return l[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":21617,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:43:19","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return 0\n count = count + 1\n length = count_letters(s[:-1])\n if length == 0:\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":10692,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:43:27","func_code":"def power(m, n):\n if n == 0:\n return 1\n return n * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":22146,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 14:43:33","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] < l[-1]:\n return minimum(l[:-1])\n else:\n return minimum(l[:-2] + l[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":33624,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 14:43:33","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] < l[-1]:\n return minimum(l[:-1])\n else:\n return minimum(l[:-2] + l[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":18717,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:43:41","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":39514,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:43:41","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":25623,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:43:42","func_code":"def power(n, p):\n if n == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":14495,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 14:43:52","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":38623,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 14:43:52","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":40737,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 14:43:57","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24479,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 14:43:57","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":15405,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:44:13","func_code":"def power(n, p):\n if n == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":944,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:44:22","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > minimum(a[1:]):\n return a[0]\n else:\n return minimum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":20111,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:44:24","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n elif n[-2] < n[-1]:\n return minimum(n[:-1])\n else:\n return minimum(n[:-2] + n[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":38507,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:44:24","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n elif n[-2] < n[-1]:\n return minimum(n[:-1])\n else:\n return minimum(n[:-2] + n[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":25905,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:44:26","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return l\n else:\n return l[-1] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":19376,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:44:28","func_code":"def count_letters(word):\n try:\n i = i + 1\n return count_letters(word[1:])\n except:\n return i","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":37429,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:44:29","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = maximum(l[1:])\n if l[0] > nl:\n return l[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":18351,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:44:29","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = maximum(l[1:])\n if l[0] > nl:\n return l[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":23306,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:44:31","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":36337,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:44:31","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":16114,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:44:41","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = maximum(l[1:])\n if l[0] > nl:\n return l[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":22407,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:44:41","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = maximum(l[1:])\n if l[0] > nl:\n return l[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":14314,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:44:42","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return len(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":9212,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:44:46","func_code":"def count_letters(word):\n i = 0\n try:\n i = i + 1\n return count_letters(word[1:])\n except:\n return i","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":5099,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:44:47","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return []\n else:\n return l[-1] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":24863,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:45:01","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n elif n[-2] > n[-1]:\n return maximum(n[:-1])\n else:\n return maximum(n[:-2] + n[-1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":12688,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:45:01","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n elif n[-2] > n[-1]:\n return maximum(n[:-1])\n else:\n return maximum(n[:-2] + n[-1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":41531,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:45:05","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > maximun(a[1:]):\n return a[0]\n else:\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":2494,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:45:14","func_code":"def minimum(n):\n if len(n) == 1:\n return n\n if n[0] > minimum(n[1:]):\n return n + 1\n else:\n return minimum(n - 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":20424,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:45:18","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > maximum(a[1:]):\n return a[0]\n else:\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":18552,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:45:18","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > maximum(a[1:]):\n return a[0]\n else:\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":34075,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:45:19","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return []\n else:\n return [l[-1] + reverse_list(l[:-1])]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":37382,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 14:45:34","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":15091,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 14:45:34","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7761,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:45:35","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":38463,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:45:37","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n elif a[0] < minimum(l[1:]):\n return a[0]\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":42171,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:45:48","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":13481,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 14:45:48","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":19393,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:45:49","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n elif l[0] < minimum(l[1:]):\n return l[0]\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":1466,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:45:54","func_code":"def minimum(x):\n if len(x) == 1:\n return x[0]\n else:\n n, m = x[0], minimum(x[1:])\n if n < m:\n return n\n else:\n return m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":36178,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:45:54","func_code":"def minimum(x):\n if len(x) == 1:\n return x[0]\n else:\n n, m = x[0], minimum(x[1:])\n if n < m:\n return n\n else:\n return m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":14531,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:45:55","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":4801,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:45:55","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":10188,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:46:05","func_code":"def count_letters(word):\n if word == '':\n return 0\n try:\n i = i + 1\n return count_letters(word[1:])\n except:\n return i","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":21801,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:46:16","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":26892,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:46:16","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30571,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:46:18","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n return l[0] < minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":13458,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:46:18","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = minimum(l[1:])\n if l[0] < nl:\n return l[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":15988,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:46:18","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = minimum(l[1:])\n if l[0] < nl:\n return l[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":36053,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:46:19","func_code":"def string_length(s):\n return 1 + string_length(s[1:]) if s else 0\n\n\ndef count_letters(s):\n if not s:\n return 0\n return string_length(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":13046,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:46:29","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":31661,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:46:53","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n elif l[0] < minimum(l[1:]):\n return l[0]\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":40432,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:46:53","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n elif l[0] < minimum(l[1:]):\n return l[0]\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":15439,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:47:05","func_code":"def count_letters(string):\n if string == '':\n return 0\n else:\n return 1 + count_letters(string[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":16712,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:47:05","func_code":"def count_letters(string):\n if string == '':\n return 0\n else:\n return 1 + count_letters(string[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":1151,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:47:07","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n large = a[0]\n if a[1] > a[0]:\n a.remove(a[0])\n else:\n a.remove(a[1])\n return maximum(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":10627,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:47:07","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n large = a[0]\n if a[1] > a[0]:\n a.remove(a[0])\n else:\n a.remove(a[1])\n return maximum(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":22917,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:47:12","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n head = a[0]\n tail = a[1:]\n mintail = minimum(tail)\n if head > mintail:\n smallest = mintail\n else:\n smallest = head\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":32643,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:47:12","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n head = a[0]\n tail = a[1:]\n mintail = minimum(tail)\n if head > mintail:\n smallest = mintail\n else:\n smallest = head\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":22910,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:47:15","func_code":"def count_letters(s):\n if s == '':\n return 0\n elif s != '':\n s = s.split()\n total += 1\n return total + count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":15218,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:47:15","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = maximum(l[1:])\n if l[0] > nl:\n return l[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":28412,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:47:15","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n nl = maximum(l[1:])\n if l[0] > nl:\n return l[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":40544,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:47:26","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":15503,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 14:47:26","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":31122,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:47:35","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n elif l[0] > maximum(l[1:]):\n return l[0]\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":33367,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:47:35","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n elif l[0] > maximum(l[1:]):\n return l[0]\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":18933,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 14:47:46","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] > l[-1]:\n return maximum(l[:-1])\n else:\n return maximum(l[:-2] + l[-1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":34983,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 14:47:46","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[-2] > l[-1]:\n return maximum(l[:-1])\n else:\n return maximum(l[:-2] + l[-1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":18253,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:47:51","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":2096,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:47:51","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":17440,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:48:00","func_code":"def count_letters(n):\n if n == '':\n return 0\n return 1 + count_letters(n[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":809,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:48:00","func_code":"def count_letters(n):\n if n == '':\n return 0\n return 1 + count_letters(n[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":32395,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:48:21","func_code":"def count_letters(n):\n if not n:\n return 0\n return 1 + count_letters(n[1:]) if n else 0","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":23804,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:48:21","func_code":"def count_letters(n):\n if not n:\n return 0\n return 1 + count_letters(n[1:]) if n else 0","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":11822,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:48:33","func_code":"def count_letters(s):\n if s == '':\n return 0\n count = 0\n for ch in s:\n count += 1\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":37902,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:48:44","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:]) if s else 0","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":22739,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:48:44","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:]) if s else 0","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":26156,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 14:48:45","func_code":"def minimum(li):\n if len(li) == 1:\n return li[0]\n small = li.pop(0)\n v = minimum(li)\n if v < small:\n small = v\n return small","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":4316,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 14:48:45","func_code":"def minimum(li):\n if len(li) == 1:\n return li[0]\n small = li.pop(0)\n v = minimum(li)\n if v < small:\n small = v\n return small","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":28006,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:48:50","func_code":"def count_letters(word):\n if word == '':\n return 0\n else:\n return 1 + count_letters(word[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":4526,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:48:50","func_code":"def count_letters(word):\n if word == '':\n return 0\n else:\n return 1 + count_letters(word[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":7722,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:48:56","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n biggest = minimum(a[1:])\n if a[0] > biggest:\n return a[0]\n else:\n return biggest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":2282,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:48:58","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return count_letters(len(s) - 1)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":2513,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 14:49:10","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n if nums[-1] < nums[-2]:\n return maximum(nums[:-1])\n else:\n return maximum(nums[:-2] + nums[-1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":11213,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 14:49:10","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n if nums[-1] < nums[-2]:\n return maximum(nums[:-1])\n else:\n return maximum(nums[:-2] + nums[-1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":39653,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:49:19","func_code":"def maximum(x):\n if len(x) == 1:\n return x[0]\n else:\n n, m = x[0], maximum(x[1:])\n if n > m:\n return n\n else:\n return m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":34521,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:49:19","func_code":"def maximum(x):\n if len(x) == 1:\n return x[0]\n else:\n n, m = x[0], maximum(x[1:])\n if n > m:\n return n\n else:\n return m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":41648,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:49:30","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":9799,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 14:49:33","func_code":"def power(n, t):\n return n ** t","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":14145,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:49:38","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return count_letters(s[:1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":36767,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:49:47","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":39731,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 14:49:53","func_code":"def power(n, t):\n return n ** t","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":13035,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 14:50:09","func_code":"def power(n, t):\n if t == 0:\n return 1\n t -= 1\n return n * power(n, t)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":30871,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 14:50:09","func_code":"def power(n, t):\n if t == 0:\n return 1\n t -= 1\n return n * power(n, t)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":3931,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:50:22","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n mini = minimum(l[1:])\n if l[0] > mini:\n return mini\n else:\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":3127,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:50:22","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n mini = minimum(l[1:])\n if l[0] > mini:\n return mini\n else:\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":32574,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:50:27","func_code":"def minimum(n):\n if n == 0:\n return n\n elif n[0] < n[1:]:\n return n[0]\n elif n[0] > n[1:]:\n return minimum(n - 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":19956,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:50:34","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n head = a[0]\n tail = a[1:]\n mintail = minimum(tail)\n if head < mintail:\n smallest = mintail\n else:\n smallest = head\n return smallest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":40028,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:50:42","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n biggest = maximum(a[1:])\n if a[0] > biggest:\n return a[0]\n else:\n return biggest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":30813,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 14:50:42","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n biggest = maximum(a[1:])\n if a[0] > biggest:\n return a[0]\n else:\n return biggest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":2638,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:50:49","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n head = a[0]\n tail = a[1:]\n mintail = maximum(tail)\n if head < mintail:\n smallest = mintail\n else:\n smallest = head\n return smallest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":35674,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 14:50:49","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n head = a[0]\n tail = a[1:]\n mintail = maximum(tail)\n if head < mintail:\n smallest = mintail\n else:\n smallest = head\n return smallest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":14722,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:50:56","func_code":"def count_letters(s):\n if not s:\n return 0\n if len(s) == 1:\n return 1\n return count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":1668,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:51:00","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n if len(s) == 1:\n return 1\n return count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":10862,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:51:01","func_code":"def count_letters(s):\n if s == '':\n return 0\n s = s.replace(s[0], '', 1)\n return 1 + count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":12541,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:51:18","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":5240,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:51:18","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":31459,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:51:18","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":31857,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:51:22","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30695,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:51:22","func_code":"def minimum(l=[]):\n if len(l) == 1:\n return l[0]\n elif l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":5736,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:51:22","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":18046,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:51:34","func_code":"def count_letters(s):\n total = 0\n for c in (s - 1):\n total += 1\n return count_letters(s[:-1]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":7602,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:51:34","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":16598,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:51:35","func_code":"def count_letters(s):\n if not s:\n return 0\n if len(s) == 1:\n return 1\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30461,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:51:35","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n maxi = maximum(l[1:])\n if l[0] < maxi:\n return maxi\n else:\n return l[0]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":31519,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:51:35","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n maxi = maximum(l[1:])\n if l[0] < maxi:\n return maxi\n else:\n return l[0]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":21519,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:51:35","func_code":"def count_letters(s):\n if not s:\n return 0\n if len(s) == 1:\n return 1\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":35540,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:51:36","func_code":"def count_letters(s):\n if s == '':\n return 0\n s = s.replace(s[0], '', 1)\n return 1 + count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":38235,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:51:48","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":40115,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 14:51:48","func_code":"def power(base, ind):\n if ind == 0:\n return 1\n return base * power(base, ind - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":39448,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 14:51:48","func_code":"def power(base, ind):\n if ind == 0:\n return 1\n return base * power(base, ind - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":28623,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:51:48","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":42486,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 14:51:51","func_code":"def maximum(li):\n if len(li) == 1:\n return li[0]\n big = li.pop(0)\n v = maximum(li)\n if big < v:\n big = v\n return big","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":4346,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 14:51:51","func_code":"def maximum(li):\n if len(li) == 1:\n return li[0]\n big = li.pop(0)\n v = maximum(li)\n if big < v:\n big = v\n return big","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":10626,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:51:52","func_code":"def count_letters(w):\n if w == '':\n return 0\n return 1 + count_letters(w[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":3374,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:51:52","func_code":"def count_letters(w):\n if w == '':\n return 0\n return 1 + count_letters(w[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":14595,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:52:03","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":7144,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:52:03","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":455,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:52:03","func_code":"def count_letters(s):\n total = 0\n for c in s[:-1]:\n total += 1\n return count_letters(s[:-1]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":14846,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:52:08","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n return reverse(l[:-1] + l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":9761,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:52:17","func_code":"def count_letters(n):\n if n == '':\n return 0\n return 1 + count_letters(n[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":6821,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:52:17","func_code":"def count_letters(n):\n if n == '':\n return 0\n return 1 + count_letters(n[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":14789,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:52:20","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n if len(s) == 1:\n return 1\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":15026,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 14:52:20","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n if len(s) == 1:\n return 1\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":33046,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:52:27","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n return reverse_list(l[:-1] + l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":17461,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:52:28","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":19273,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 14:52:28","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":12017,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:53:07","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16963,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:53:07","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28358,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:53:16","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n minimum = minimum(l[1])\n if l[0] < minimum:\n l.pop(minimum)\n else:\n l.pop(l[0])\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":26478,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:53:21","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n return reverse_list(l[-1:])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":18598,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:53:32","func_code":"def minimum(a):\n return min(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":13803,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:53:32","func_code":"def minimum(a):\n return min(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":39099,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:53:41","func_code":"def minimum(l=[]):\n if len(l) == 1:\n return l[0]\n elif l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":2052,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:53:41","func_code":"def minimum(l=[]):\n if len(l) == 1:\n return l[0]\n elif l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":36150,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:53:41","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n mini = minimum(l[1])\n if l[0] < mini:\n l.pop(mini)\n else:\n l.pop(l[0])\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":3825,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:53:46","func_code":"def maximum(l=[]):\n if len(l) == 1:\n return l[0]\n elif l[0] > maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":23740,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:53:46","func_code":"def maximum(l=[]):\n if len(l) == 1:\n return l[0]\n elif l[0] > maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":25666,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:53:49","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n return reverse_list(l[-1:])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":14453,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 14:53:51","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n nl = minimum(a[1:])\n if a[0] < nl:\n return a[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":8180,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 14:53:51","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n nl = minimum(a[1:])\n if a[0] < nl:\n return a[0]\n else:\n return nl","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":35020,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:53:52","func_code":"def minimum(n):\n if n == 0:\n return n\n elif n[0] < minimum(n[1:]):\n return n[0]\n elif n[0] > n[1:]:\n return minimum(n - 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":8972,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 14:53:53","func_code":"def count_letters(s):\n i = 0\n for char in s:\n i += 1\n return i","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":17257,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:54:03","func_code":"def maximum(a):\n return max(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":1379,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:54:03","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n ** p","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":482,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:54:03","func_code":"def maximum(a):\n return max(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":30664,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:54:14","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":28775,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:54:14","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":4924,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-04-03 14:54:14","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":17644,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:54:16","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":27537,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:54:16","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":23301,"user":"d86203fa-9e1b-4fc0-a3a6-b40a78065d80","date":"2018-04-03 14:54:16","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":624,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:54:42","func_code":"def count_letters(s):\n return len(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":32587,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:54:42","func_code":"def count_letters(s):\n return len(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":14821,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 14:55:05","func_code":"def reverse_list(l):\n if reverse_list.count == len(l) \/\/ 2:\n return l\n l.insert(-1, l.pop(0))\n reverse_list.count += 1\n try:\n return reverse_list(l)\n finally:\n reverse_list.count = 0","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":19356,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 14:55:08","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n nl = maximum(a[1:])\n if a[0] > nl:\n return a[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":19211,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 14:55:08","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n nl = maximum(a[1:])\n if a[0] > nl:\n return a[0]\n else:\n return nl","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":33320,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 14:55:17","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":16430,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 14:55:17","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":14701,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:55:23","func_code":"def reverse_list(ihavethehighground):\n if len(ihavethehighground) == 1:\n return ihavethehighground\n else:\n return s[-1] + power(s[-1] - 1)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":9857,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:55:42","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a[0]\n return a[0].append(reverse_list(a[1:]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":3591,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:55:44","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n else:\n return reverse_list[:-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":17455,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:55:48","func_code":"def reverse_list(ihavethehighground):\n if len(ihavethehighground) == 1:\n return ihavethehighground\n else:\n return ihavethehighground[-1] + power(ihavethehighground[-1] - 1)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":1554,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:55:50","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":32376,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 14:55:50","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":5840,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 14:55:52","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > l[-1]:\n return minimum(l[1:])\n else:\n return minimum(l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41078,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 14:55:52","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > l[-1]:\n return minimum(l[1:])\n else:\n return minimum(l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":4010,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:55:53","func_code":"def reverse_list(s):\n if len(s) == 1:\n return s\n else:\n return s[-1] + reverse_list[:-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":31024,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 14:56:02","func_code":"def minimum(n):\n if n == 0:\n return n\n elif n[0] < minimum(n[1:]):\n return n[0]\n else:\n n[0] > n[1:]\n return minimum(n - 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":33222,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:56:09","func_code":"def reverse_list(ihavethehighground):\n if len(ihavethehighground) == 1:\n return ihavethehighground\n else:\n return ihavethehighground[-1] + reverse_list(ihavethehighground[-1] - 1\n )","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":20326,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 14:56:16","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n return reverse_list(l[::-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":28223,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:56:17","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return a[0].append(reverse_list(a[1:]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":34756,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:56:22","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n else:\n return reverse_list[:-2]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":23472,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:56:44","func_code":"def reverse_list(l):\n if l == []:\n return l\n tmp = reverse_list(l[1:])\n tmp.append(l[0])\n return tmp","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":22754,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:56:44","func_code":"def reverse_list(a):\n return reverse(a)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":13043,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 14:56:44","func_code":"def reverse_list(l):\n if l == []:\n return l\n tmp = reverse_list(l[1:])\n tmp.append(l[0])\n return tmp","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":35986,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:56:59","func_code":"def reverse_list(a):\n return a.reverse()","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":38738,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 14:57:00","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < l[-1]:\n return maximum(l[1:])\n else:\n return maximum(l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":22599,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 14:57:00","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < l[-1]:\n return maximum(l[1:])\n else:\n return maximum(l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":30350,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:57:20","func_code":"def reverse_list(a):\n return a[::-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":2596,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:57:20","func_code":"def reverse_list(a):\n return a[::-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":19055,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:57:24","func_code":"def reverse_list(ihavethehighground):\n if len(ihavethehighground) == 1:\n return ihavethehighground\n else:\n return ihavethehighground[-1] + reverse_list(ihavethehighground[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":6777,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:57:26","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return reverse_list(a[1:]).append(a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":42374,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 14:57:31","func_code":"def count_letters(s):\n total = 0\n if not s:\n return total\n else:\n for c in s[:-1]:\n total += 1\n return count_letters(s) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":3464,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:57:41","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n new_l = minimum(l[1:])\n if l[0] > new_l:\n return l[0]\n else:\n return new_l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":40394,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:57:55","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n new_l = minimum(l[1:])\n if l[0] < new_l:\n return l[0]\n else:\n return new_l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":25958,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:57:55","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n new_l = minimum(l[1:])\n if l[0] < new_l:\n return l[0]\n else:\n return new_l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":37768,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:57:57","func_code":"def reverse_list(ihavethehighground):\n if len(ihavethehighground) == 1:\n return ihavethehighground\n else:\n return [ihavethehighground[-1]] + reverse_list(ihavethehighground[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":761,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:58:10","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":22948,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 14:58:10","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":19763,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:58:16","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":23357,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 14:58:16","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":5541,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 14:58:17","func_code":"def reverse_list(s, x=[]):\n if len(s) == 1:\n return s\n else:\n x.append(s[-1])\n return x + reverse_list(s[0:len(s) - 1], x)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":37160,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:58:28","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a[0]\n l = reverse_list(a[1:]).append(a[0])\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":34612,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 14:58:36","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n mini = minimum(l[1])\n if l[0] < mini:\n l.pop(mini)\n else:\n l.pop(l[0])\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":28403,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:58:43","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n new_l = maximum(l[1:])\n if l[0] > new_l:\n return l[0]\n else:\n return new_l","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":2149,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 14:58:43","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n new_l = maximum(l[1:])\n if l[0] > new_l:\n return l[0]\n else:\n return new_l","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":17394,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 14:58:51","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n l = reverse_list(a[1:]).append(a[0])\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":16393,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:59:08","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":12507,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:59:08","func_code":"def reverse_list(a, x=0):\n if len(a) == 1:\n return a\n f = reverse_list[:-1]\n x.append(f)\n return x","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":16733,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 14:59:08","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":40121,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:59:16","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return [n[-1]] + reverse_list(n[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":10384,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 14:59:16","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return [n[-1]] + reverse_list(n[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":666,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:59:20","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":29193,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 14:59:20","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":38460,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:59:21","func_code":"def reverse_list(a, x=[]):\n if len(a) == 1:\n return a\n f = reverse_list[:-1]\n x.append(f)\n return x","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":27713,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:59:33","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":22727,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 14:59:33","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":32558,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:59:34","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return n + fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22748,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-03 14:59:34","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return n + fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40317,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:59:41","func_code":"def reverse_list(ihavethehighground):\n if len(ihavethehighground) == 1 or len(ihavethehighground) == 0:\n return ihavethehighground\n else:\n return [ihavethehighground[-1]] + reverse_list(ihavethehighground[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":6827,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 14:59:41","func_code":"def reverse_list(ihavethehighground):\n if len(ihavethehighground) == 1 or len(ihavethehighground) == 0:\n return ihavethehighground\n else:\n return [ihavethehighground[-1]] + reverse_list(ihavethehighground[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":4979,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 14:59:48","func_code":"def reverse_list(a, x=[]):\n if len(a) == 1:\n return a\n f = reverse_list(a[:-1])\n x.append(f)\n return x","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":39552,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 15:00:05","func_code":"def reverse_list(a, b=0):\n if a == 0:\n return 0\n c = reverse_list[-1:]\n a.append(c)\n return c","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":19023,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 15:00:13","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1142,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 15:00:13","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15833,"user":"dd2b828e-e813-417d-b910-df48d2f89ccc","date":"2018-04-03 15:00:13","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16732,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-03 15:00:31","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n le = a[0:1]\n a = a[1:]\n if minimum(le) < minimum(a):\n return minimum(le)\n else:\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12171,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-03 15:00:31","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n le = a[0:1]\n a = a[1:]\n if minimum(le) < minimum(a):\n return minimum(le)\n else:\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":10589,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:00:40","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n new_l = minimum(l[1:])\n if l[0] < new_l:\n return l[0]\n else:\n return new_l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":36957,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:00:40","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n new_l = minimum(l[1:])\n if l[0] < new_l:\n return l[0]\n else:\n return new_l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41265,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:00:48","func_code":"def reverse_list(s, x=[]):\n if len(s) == 1 or len(s) == 0:\n return s\n else:\n x.append(s[-1])\n return x + reverse_list(s[:-1], x)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":5314,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 15:00:53","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":27717,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 15:00:53","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":37113,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 15:01:03","func_code":"def reverse_list(a, x=[]):\n if len(a) == 1 or len(a) == 0:\n return a\n f = reverse_list(a[:-1])\n x.append(f)\n return x","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":6800,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 15:01:13","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n l = reverse_list(a[1:])\n l.append(a[0])\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":1941,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 15:01:19","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41557,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 15:01:19","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":39696,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 15:01:36","func_code":"def fibonacci(N):\n if N == 0 or N == 1:\n return 1\n return fibonacci(N - 1) + fibonacci(N - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8417,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 15:01:36","func_code":"def fibonacci(N):\n if N == 0 or N == 1:\n return 1\n return fibonacci(N - 1) + fibonacci(N - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15143,"user":"3a3b6ee9-ae37-4d43-b10a-27ade2385dcd","date":"2018-04-03 15:01:36","func_code":"def fibonacci(N):\n if N == 0 or N == 1:\n return 1\n return fibonacci(N - 1) + fibonacci(N - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23971,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:01:44","func_code":"def reverse_list(s):\n if len(s) == 1 or len(s) == 0:\n return s\n else:\n return s[-1] + reverse_list(s[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":21942,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 15:01:50","func_code":"def count_letters(s):\n if s == '':\n return 0\n s = s[1:]\n return 1 + count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":21358,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 15:01:50","func_code":"def count_letters(s):\n if s == '':\n return 0\n s = s[1:]\n return 1 + count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":27393,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-03 15:01:50","func_code":"def count_letters(s):\n if s == '':\n return 0\n s = s[1:]\n return 1 + count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":17501,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 15:01:52","func_code":"def count_letters(s):\n if s == '':\n return 0\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41626,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 15:01:52","func_code":"def count_letters(s):\n if s == '':\n return 0\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30950,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 15:01:56","func_code":"def reverse_list(a):\n if not a:\n return a\n if len(a) == 1:\n return a\n l = reverse_list(a[1:])\n l.append(a[0])\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":15491,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 15:01:56","func_code":"def reverse_list(a):\n if not a:\n return a\n if len(a) == 1:\n return a\n l = reverse_list(a[1:])\n l.append(a[0])\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":3633,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 15:02:11","func_code":"def reverse_list(x):\n if x == '':\n return x\n else:\n return x[-1] + reverse_list(x[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":21129,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:02:18","func_code":"def reverse_list(s):\n if len(s) == 1 or len(s) == 0:\n return s\n else:\n return [s[-1]] + reverse_list(s[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":11439,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:02:18","func_code":"def reverse_list(s):\n if len(s) == 1 or len(s) == 0:\n return s\n else:\n return [s[-1]] + reverse_list(s[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":18340,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 15:02:19","func_code":"def reverse_list(a, b=0):\n if len(a) == 0 or len(a) == 1:\n return 0\n else:\n return a[-1:]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":26214,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 15:02:19","func_code":"def count_letters(s):\n if s == '':\n return 0\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":11846,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 15:02:19","func_code":"def count_letters(s):\n if s == '':\n return 0\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":23410,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 15:02:30","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n return reverse_list(a[1:]).append(a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":25331,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 15:02:32","func_code":"def count_letters(a):\n if a == '':\n return 0\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":8457,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 15:02:34","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n else:\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":25686,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 15:02:34","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n else:\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":41129,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 15:02:37","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19857,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 15:02:37","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36975,"user":"1e76a94c-89e1-4ef2-b3bb-9e98e7be1a2c","date":"2018-04-03 15:02:37","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18525,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:02:40","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n new_l = maximum(l[1:])\n if l[0] > new_l:\n return l[0]\n else:\n return new_l","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":4093,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:02:40","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n new_l = maximum(l[1:])\n if l[0] > new_l:\n return l[0]\n else:\n return new_l","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":26199,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 15:02:42","func_code":"def count_letters(a):\n if a == '':\n return 0\n return count_letters(a[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":40946,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 15:02:42","func_code":"def count_letters(a):\n if a == '':\n return 0\n return count_letters(a[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":19033,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 15:02:54","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n else:\n for c in s[:-1]:\n total += 1\n s = s[c:-1]\n return count_letters(s) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":32638,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 15:03:01","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n cancer = reverse_list(a[1:])\n cancer.append(a[0])\n return cancer","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":28606,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 15:03:15","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n can = reverse_list(a[1:])\n can.append(a[0])\n return can","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":664,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 15:03:15","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n can = reverse_list(a[1:])\n can.append(a[0])\n return can","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":12863,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 15:03:25","func_code":"def reverse_list(a, b=0):\n if len(a) == 0 or len(a) == 1:\n return 0\n else:\n return [a[-1:]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":25571,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 15:03:39","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n ns = s[1:]\n return 1 + count_letters(ns)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41861,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 15:03:39","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n ns = s[1:]\n return 1 + count_letters(ns)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":21859,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-03 15:03:39","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n ns = s[1:]\n return 1 + count_letters(ns)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":33647,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 15:03:40","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18288,"user":"5bdbfa0a-a632-46ed-9ff7-06f5062efb09","date":"2018-04-03 15:03:40","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18542,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 15:03:43","func_code":"def reverse_list(a, b=0):\n if len(a) == 0 or len(a) == 1:\n return 0\n else:\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":5801,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 15:03:45","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7794,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 15:03:45","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":31236,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 15:03:45","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18916,"user":"6bdfefac-1fa3-44c6-b066-9e1536e0210e","date":"2018-04-03 15:03:45","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22976,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 15:03:45","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":6182,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 15:03:46","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] >= maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":24188,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 15:03:46","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] >= maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":40846,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 15:04:01","func_code":"def reverse_list(a):\n if len(a) == 0 or len(a) == 1:\n return 0\n else:\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":10113,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 15:04:01","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n else:\n i = 0\n for c in s[:-1]:\n total += 1\n i += 1\n s = s[i:-1]\n return count_letters(s) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":21182,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 15:04:42","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return total\n else:\n i = 0\n for c in s[:-1]:\n total += 1\n i += 1\n s = s[i:-1]\n return count_letters(s) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":15059,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:04:42","func_code":"def minimum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[0]\n return minimum(l, i + 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":20393,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:04:42","func_code":"def minimum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[0]\n return minimum(l, i + 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":20418,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 15:04:50","func_code":"def reverse_list(a):\n if len(a) == 0 or len(a) == 1:\n return 1\n else:\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":6136,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 15:04:50","func_code":"def reverse_list(a):\n if len(a) == 0 or len(a) == 1:\n return 1\n else:\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":22775,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:04:54","func_code":"def minimum(l=[]):\n if len(l) == 1:\n return l[0]\n if l[0] < minimum(l[:]):\n return l[0]\n else:\n return minimum(l[:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":7141,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 15:05:04","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":3344,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 15:05:04","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25417,"user":"2f42085d-bb24-498f-9d99-42137e03966f","date":"2018-04-03 15:05:04","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34262,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 15:05:09","func_code":"def minimum(n):\n if n == 0:\n return n\n elif n[0] < minimum(n[1:]):\n return n[0]\n else:\n n[0] > n[1:]\n return minimum(n - 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":15151,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 15:05:38","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21400,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 15:05:38","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8602,"user":"e3c31dbf-4c63-4e59-aa78-540cb586910e","date":"2018-04-03 15:05:38","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29967,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:05:40","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n return total + count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":16663,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 15:05:52","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10461,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 15:05:52","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26003,"user":"75fca52d-a61c-4d91-946c-d376c5569767","date":"2018-04-03 15:05:52","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17597,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:06:00","func_code":"def minimum(l=[]):\n if len(l) == 1:\n return l[0]\n if l[0] < minimum(l[0:]):\n return l[0]\n else:\n return minimum(l[:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":9959,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:06:14","func_code":"def minimum(l=[]):\n if len(l) == 1:\n return l[0]\n if l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":3746,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:06:26","func_code":"def minimum(l=[]):\n if len(l) == 1:\n return l[0]\n if l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":11454,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:06:26","func_code":"def minimum(l=[]):\n if len(l) == 1:\n return l[0]\n if l[0] < minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":27369,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 15:06:34","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36024,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 15:06:34","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30564,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-03 15:06:34","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34678,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:06:41","func_code":"def maximum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[-1]\n return minimum(l, i + 1)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":40565,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 15:06:42","func_code":"def reverse_list(x):\n if len(x) == 0:\n return x\n else:\n return [x[-1]] + reverse_list(x[0:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":31063,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 15:06:42","func_code":"def reverse_list(x):\n if len(x) == 0:\n return x\n else:\n return [x[-1]] + reverse_list(x[0:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":31786,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 15:06:42","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return a[-1:] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":10628,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:07:02","func_code":"def maximum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[-1]\n return maximum(l, i + 1)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":38952,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:07:02","func_code":"def maximum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[-1]\n return maximum(l, i + 1)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":25441,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:07:21","func_code":"def minimum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[0]\n return minimum(l, i + 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":25199,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 15:07:25","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return a[len(a) - 1] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":18890,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:07:33","func_code":"def maximum(l=[]):\n if len(l) == 1:\n return l[0]\n if l[0] > maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":21688,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:07:33","func_code":"def maximum(l=[]):\n if len(l) == 1:\n return l[0]\n if l[0] > maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":13133,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 15:07:34","func_code":"def fibonacci(nth):\n if n == 1 or n == 0:\n return 1\n return n - 1 + power(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23603,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 15:07:35","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return a[-1] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":19448,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 15:07:54","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return a[-1] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":22988,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 15:08:03","func_code":"def fibonacci(nth):\n if nth == 1 or nth == 0:\n return 1\n return nth - 1 + power(nth - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1489,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 15:08:12","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return a[-1:] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":31598,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 15:08:15","func_code":"def count_letters(s):\n if len(s) == 1:\n return 1\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":12405,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 15:08:18","func_code":"def fibonacci(nth):\n if nth == 1 or nth == 0:\n return 1\n return nth - 1 + fibonacci(nth - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18198,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 15:08:30","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n mins = minimum(l[1:])\n if mins < l[0]:\n return mins\n else:\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":10420,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 15:08:30","func_code":"def reverse_list(l):\n if reverse_list.count == len(l) \/\/ 2:\n return l\n x = l.pop(0)\n l.append(x)\n reverse_list.count += 1\n try:\n print(reverse_list.count)\n return reverse_list(l)\n finally:\n reverse_list.count = 0","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":37961,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 15:08:30","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n mins = minimum(l[1:])\n if mins < l[0]:\n return mins\n else:\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":21158,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 15:08:39","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":22763,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 15:08:39","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":32809,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:08:39","func_code":"def maximum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[-1]\n return maximum(l, i + 1)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":26436,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:08:39","func_code":"def maximum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[-1]\n return maximum(l, i + 1)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":39404,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 15:08:43","func_code":"def fibonacci(a):\n if a == 0 or a == 1:\n return 1\n else:\n return a + fibonacci(a - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40466,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:08:48","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n else:\n return n + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17031,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 15:08:49","func_code":"def fibonacci(x):\n if x == 0:\n return 1\n elif x == 1:\n return 1\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15495,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 15:08:49","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":19563,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 15:08:49","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":39098,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-03 15:08:49","func_code":"def fibonacci(x):\n if x == 0:\n return 1\n elif x == 1:\n return 1\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34806,"user":"ebcb6801-87f5-4fa5-b252-f89ccb02603a","date":"2018-04-03 15:08:49","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":31365,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 15:08:52","func_code":"def fibonacci(nth):\n if nth == 1 or nth == 0:\n return 1\n return nth + fibonacci(nth - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25411,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:08:55","func_code":"def minimum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[0]\n return minimum(l, i + 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":39140,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:08:55","func_code":"def minimum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[0]\n return minimum(l, i + 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":20990,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 15:08:56","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n return a[-1:] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30015,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 15:08:56","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n return a[-1:] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":2316,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 15:09:00","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a[0]\n b = []\n b.append(reverse_list(a))\n return b[-1:]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":41807,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:09:10","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n else:\n return n + fibonacci(n - 3)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40572,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 15:09:16","func_code":"def fibonacci(nth):\n if nth == 1 or nth == 0:\n return 1\n return nth - 1 + fibonacci(nth - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29770,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 15:09:19","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":16507,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 15:09:32","func_code":"def fibonacci(a):\n if a == 0 or a == 1:\n return 1\n x = a\n else:\n return x + fibonacci(a - x)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19499,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 15:09:40","func_code":"def fibonacci(nth):\n if nth == 1 or nth == 0:\n return 1\n return nth + 1 + fibonacci(nth - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14265,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 15:09:44","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":18757,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 15:09:44","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":35097,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 15:09:48","func_code":"def fibonacci(a):\n if a == 0 or a == 1:\n return 1\n x = a\n else:\n return a + fibonacci(a - x)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33712,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 15:10:10","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":10574,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 15:10:10","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":36161,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 15:10:15","func_code":"def fibonacci(a):\n x = a\n if a == 0 or a == 1:\n return 1\n else:\n return a + fibonacci(a - x)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7531,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:10:22","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n return total + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":12859,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:10:24","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n else:\n return n - 1 + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15326,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:10:31","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n return total + count_letters(s[0:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":33999,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 15:10:57","func_code":"def fibonacci(nth):\n if nth == 1 or nth == 0:\n return 1\n return fibonacci(nth - 1) + fibonacci(nth - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7346,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:11:06","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n else:\n return n + fibonacci((n - 2) * 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16953,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 15:11:14","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a[0]\n b = []\n i = 0\n b.append(reverse_list(a[i])) + 1\n return b[-1:]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":27349,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 15:11:17","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15264,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 15:11:23","func_code":"def fibonacci(a):\n if a == 0 or a == 1:\n return 1\n else:\n return fibonacci(a - 1) + fibonacci(a - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17869,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 15:11:23","func_code":"def fibonacci(a):\n if a == 0 or a == 1:\n return 1\n else:\n return fibonacci(a - 1) + fibonacci(a - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27052,"user":"3386630d-db39-4134-a4bb-b4908e2b7522","date":"2018-04-03 15:11:23","func_code":"def fibonacci(a):\n if a == 0 or a == 1:\n return 1\n else:\n return fibonacci(a - 1) + fibonacci(a - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25100,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 15:11:33","func_code":"def fibonacci(nth):\n if nth == 1 or nth == 0:\n return 1\n return nth - 1 + fibonacci(nth - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38220,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 15:11:37","func_code":"def minimum(n):\n if n == 1:\n return n[0]\n else:\n return n[0] if n[0] < minimum else minimum","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":38530,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:11:39","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n else:\n return n + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13964,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 15:11:45","func_code":"def fibonacci(nth):\n if nth == 1 or nth == 0:\n return 1\n return fibonacci(nth - 1) + fibonacci(nth - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25148,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 15:11:45","func_code":"def fibonacci(nth):\n if nth == 1 or nth == 0:\n return 1\n return fibonacci(nth - 1) + fibonacci(nth - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37322,"user":"c2ac2f07-625e-4a88-84b0-2a916b646959","date":"2018-04-03 15:11:45","func_code":"def fibonacci(nth):\n if nth == 1 or nth == 0:\n return 1\n return fibonacci(nth - 1) + fibonacci(nth - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34362,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 15:11:51","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return n + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27558,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:11:58","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n else:\n return n - 1 + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8053,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:12:13","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n else:\n return n - 1 + fibonacci(n - 2) + 1","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32702,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:12:19","func_code":"def count_letters(l):\n if l == '':\n return 0\n return count_letters(l[:-1]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":11299,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:12:19","func_code":"def count_letters(l):\n if l == '':\n return 0\n return count_letters(l[:-1]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":8845,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:12:24","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n return count + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":5711,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:12:30","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n else:\n return n - 1 + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27090,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 15:12:41","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n maxs = maximum(l[1:])\n if maxs > l[0]:\n return maxs\n else:\n return l[0]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":32404,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 15:12:41","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n maxs = maximum(l[1:])\n if maxs > l[0]:\n return maxs\n else:\n return l[0]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":15070,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-03 15:12:41","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n maxs = maximum(l[1:])\n if maxs > l[0]:\n return maxs\n else:\n return l[0]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":29308,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:12:52","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n return total + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":24123,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:13:00","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n return total + count_letters(s[1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":38292,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:13:00","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16311,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:13:00","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33333,"user":"c3a18502-e93d-4fc5-ab00-d42531abe362","date":"2018-04-03 15:13:00","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17053,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:13:09","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n return total + count_letters(s[0:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":19715,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 15:13:15","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return n - 1 + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15226,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:13:17","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n return total + count_letters(s[0])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":41060,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:13:27","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return 0\n return total + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":32403,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 15:13:34","func_code":"def minimum(n):\n if n == 1:\n return n[0]\n else:\n min_ret = minimum\n return n[0] if n[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":24104,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:14:26","func_code":"def count_letters(s='', i=0):\n if s == '':\n return i\n i += 1\n return count_letters(s.replace(s[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41578,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:14:37","func_code":"def count_letters(s='', i=0):\n if s == '':\n return i\n i += 1\n return count_letters(s.replace(s[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41000,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:14:37","func_code":"def count_letters(s='', i=0):\n if s == '':\n return i\n i += 1\n return count_letters(s.replace(s[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":2017,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:14:55","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":20351,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:14:55","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":7235,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:15:19","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":15944,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:15:19","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":1888,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 15:16:17","func_code":"def reverse_list(a):\n if len(a) == 2:\n return ''\n return reverse_list(a[1:] + a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":24494,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 15:16:51","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a[0]\n tmp = reverse_list(a[1:])\n tmp.append(a[0])\n return tmp","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":36902,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 15:17:01","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":31570,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 15:17:01","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":34852,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-03 15:17:01","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":16045,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 15:17:34","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return total\n else:\n i = 0\n for c in s:\n if c.isalpha():\n s[i] = 1\n t = s[:i]\n t += s[i]\n t += s[i:]\n s = t\n if not s.isupper():\n total = 0\n for c in s:\n total += c\n return total\n else:\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":21723,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 15:17:53","func_code":"def reverse_list(a):\n if a == []:\n return a\n tmp = reverse_list(a[1:])\n tmp.append(a[0])\n return tmp","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":18032,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 15:17:53","func_code":"def reverse_list(a):\n if a == []:\n return a\n tmp = reverse_list(a[1:])\n tmp.append(a[0])\n return tmp","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":20475,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 15:18:19","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return total\n else:\n i = 0\n for c in s:\n if c.isalpha():\n s[i] = '1'\n t = s[:i]\n t += s[i]\n t += s[i:]\n s = t\n if not s.isupper():\n total = 0\n for c in s:\n total += int(c)\n return total\n else:\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":31620,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:18:28","func_code":"def count_letters(s='', i=0):\n print((s, i))\n if s == '':\n return i\n i += 1\n return count_letters(s.replace[s[0], '', 1], i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":17883,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 15:18:33","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39034,"user":"dcc424e7-96ab-4451-ad16-597d84c13c2e","date":"2018-04-03 15:18:33","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32005,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:18:51","func_code":"def count_letters(s='', i=0):\n print((s, i))\n if s == '':\n return i\n i += 1\n return count_letters(s.replace(s[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":6926,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:18:55","func_code":"def reverse_list(l):\n return l[::-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30363,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 15:19:23","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return total\n else:\n i = 0\n for c in s:\n if c.isalpha():\n t = s[:i]\n t += '1'\n t += s[i:]\n s = t\n i += 1\n if not s.isupper():\n total = 0\n for c in s:\n total += int(c)\n return total\n else:\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":18793,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:20:07","func_code":"def reverse_list(l, i=0):\n if i == len(l) \/\/ 2:\n return l\n tmp = l[i]\n l[i] = l[len(l) - 1 - i]\n l[len(l) - 1 - i] = tmp\n i += 1\n return reverse_list(l, i)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":37704,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:20:07","func_code":"def reverse_list(l, i=0):\n if i == len(l) \/\/ 2:\n return l\n tmp = l[i]\n l[i] = l[len(l) - 1 - i]\n l[len(l) - 1 - i] = tmp\n i += 1\n return reverse_list(l, i)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":38505,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:20:24","func_code":"def count_letters(s='', i=0):\n if s == '':\n return i\n i += 1\n return count_letters(s.replace(s[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":27352,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:20:24","func_code":"def count_letters(s='', i=0):\n if s == '':\n return i\n i += 1\n return count_letters(s.replace(s[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":11706,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 15:21:02","func_code":"def count_letters(s):\n total = 0\n if s == '':\n return total\n else:\n i = 0\n for c in s.lower():\n if c.islower():\n t = s[:i]\n t += '1'\n t += s[i:]\n s = t\n i += 1\n if not s.islower():\n total = 0\n for c in s:\n total += 1\n return total\n else:\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":2348,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:21:11","func_code":"def minimum(list):\n if len(list) == 1:\n return list[0]\n max_value = max(list)\n return list.remove(max_value)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":3004,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:21:38","func_code":"def minimum(list):\n if len(list) == 2:\n return list[0]\n max_value = max(list)\n return list.remove(max_value)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":23012,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 15:21:50","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33608,"user":"b799d072-e18e-40e6-96cb-77c78c9e2a0f","date":"2018-04-03 15:21:50","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30043,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:23:05","func_code":"def minimum(list):\n if len(list) == 2:\n return list[0]\n max_value = max(list)\n return minimum(list.remove(max_value))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":680,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 15:23:22","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return reverse_list(l[1:]) + l[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":12715,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 15:23:22","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return reverse_list(l[1:]) + l[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":21625,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 15:23:38","func_code":"def reverse_list(a):\n if len(a) == 2:\n return a\n return reverse_list(a[1:] + a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":2636,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:23:44","func_code":"def minimum(list=[]):\n if len(list) == 2:\n return list[0]\n max_value = max(list)\n return minimum(list.remove(max_value))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":7263,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 15:24:55","func_code":"def reverse_list(l):\n if len(l) == 0:\n return reverse_list.m\n reverse_list.m.append(l.pop())\n try:\n return reverse_list(l)\n finally:\n reverse_list.m = []","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":10289,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 15:24:55","func_code":"def reverse_list(l):\n if len(l) == 0:\n return reverse_list.m\n reverse_list.m.append(l.pop())\n try:\n return reverse_list(l)\n finally:\n reverse_list.m = []","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":36013,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 15:25:30","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return a + reverse_list(a[1:1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":21384,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 15:25:38","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15158,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 15:25:38","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40201,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-03 15:25:38","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23638,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 15:25:52","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":24394,"user":"d0af1b08-7254-49f0-8cc4-d63a85c9199d","date":"2018-04-03 15:25:52","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32959,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:25:57","func_code":"def reverse_list(l, i=0):\n if i == len(l) \/\/ 2:\n return l\n tmp = l[i]\n l[i] = l[len(l) - 1 - i]\n l[len(l) - 1 - i] = tmp\n i += 1\n return reverse_list(l, i)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":11105,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:25:57","func_code":"def reverse_list(l, i=0):\n if i == len(l) \/\/ 2:\n return l\n tmp = l[i]\n l[i] = l[len(l) - 1 - i]\n l[len(l) - 1 - i] = tmp\n i += 1\n return reverse_list(l, i)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":28995,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:26:03","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":6043,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 15:26:03","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":32522,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:26:26","func_code":"def minimum(list=[]):\n if len(list) == 1:\n return list[0]\n max_value = max(list)\n return minimum(list.remove(max_value))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":41021,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 15:27:04","func_code":"def count_letters(s):\n if not s:\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":18662,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 15:27:04","func_code":"def count_letters(s):\n if not s:\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":26291,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:27:15","func_code":"def minimum(list=[]):\n if len(list) == 1:\n return list[0]\n max_value = max(list)\n print(max_value)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":31875,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:27:29","func_code":"def minimum(list=[]):\n if len(list) == 1:\n return list[0]\n max_value = max(list)\n print(max_value)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":32310,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 15:28:02","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33391,"user":"da1464fe-2ccb-4c4e-b174-962f2177debd","date":"2018-04-03 15:28:02","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":12069,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:28:12","func_code":"def fibonacci(i, n=1):\n if i == 1 or i == 0:\n return 1\n return fibonacci(i - 1) + fibonacci(i - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26327,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:28:22","func_code":"def fibonacci(i, n=1):\n if i == 1 or i == 0:\n return 1\n return fibonacci(i - 1) + fibonacci(i - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":42229,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:28:22","func_code":"def fibonacci(i, n=1):\n if i == 1 or i == 0:\n return 1\n return fibonacci(i - 1) + fibonacci(i - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10545,"user":"7d992268-b79a-4106-8fbb-4f53742d117d","date":"2018-04-03 15:28:22","func_code":"def fibonacci(i, n=1):\n if i == 1 or i == 0:\n return 1\n return fibonacci(i - 1) + fibonacci(i - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5832,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:28:28","func_code":"def minimum(list):\n if len(list) == 1:\n return list[0]\n max_value = max(list)\n print(max_value)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":10180,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 15:29:19","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":7367,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 15:29:19","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":12155,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 15:29:37","func_code":"def fibonacci(a):\n if a == 0:\n return 1\n if a == 1:\n return 1\n return fibonacci(a - 1) + fibonacci(a - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39147,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 15:29:37","func_code":"def fibonacci(a):\n if a == 0:\n return 1\n if a == 1:\n return 1\n return fibonacci(a - 1) + fibonacci(a - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32550,"user":"f4380e0a-3bfd-44c6-b455-fe1018a45321","date":"2018-04-03 15:29:37","func_code":"def fibonacci(a):\n if a == 0:\n return 1\n if a == 1:\n return 1\n return fibonacci(a - 1) + fibonacci(a - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15874,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:30:43","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n new_l = reverse_list(l[1:]) + l[:1]\n return new_l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":8833,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:30:57","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n new_l = reverse_list(l[1:]) + l[:1]\n return new_l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":34154,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:30:57","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n new_l = reverse_list(l[1:]) + l[:1]\n return new_l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":9581,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:31:05","func_code":"def minimum(list):\n if len(list) == 1:\n return list[0]\n list = sorted(list)\n return minimum(list.pop())","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":10947,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 15:31:42","func_code":"def reverse_list(l):\n if l == []:\n return []\n return reverse_list(l[1:]) + list(l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":33288,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 15:31:42","func_code":"def reverse_list(l):\n if not l:\n return l\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":29679,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 15:31:42","func_code":"def reverse_list(l):\n if not l:\n return l\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":37831,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:32:15","func_code":"def fibonacci(i):\n if i == 1 or i == 0:\n return 1\n return fibonacci(i - 1) + fibonacci(i - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19297,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:32:15","func_code":"def fibonacci(i):\n if i == 1 or i == 0:\n return 1\n return fibonacci(i - 1) + fibonacci(i - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":31611,"user":"60b76a41-ddf8-4d27-a286-8da8c4e298cd","date":"2018-04-03 15:32:15","func_code":"def fibonacci(i):\n if i == 1 or i == 0:\n return 1\n return fibonacci(i - 1) + fibonacci(i - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30651,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 15:36:33","func_code":"def reverse_list(l):\n if l == []:\n return []\n return reverse_list(l[1:]) + l[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30568,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 15:36:33","func_code":"def reverse_list(l):\n if l == []:\n return []\n return reverse_list(l[1:]) + l[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":17655,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 15:36:40","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19269,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 15:36:40","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35853,"user":"3e6d9cdf-3f65-4f24-a2da-9a7ea1150f01","date":"2018-04-03 15:36:40","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":704,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 15:37:11","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n smallest = a.pop(0)\n x = minimum(a)\n if smallest > minimum(a):\n smallest = x\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":2508,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:39:47","func_code":"def minimum(list):\n if len(list) == 1:\n return list[0]\n elif list[0] < minimum(list[1:]):\n list[0]\n else:\n return minimum(list[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":3201,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:40:29","func_code":"def minimum(list):\n if len(list) == 1:\n return list[0]\n elif list[0] < minimum(list[1:]):\n return list[0]\n else:\n return minimum(list[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":2031,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:40:54","func_code":"def minimum(list):\n if len(list) == 1:\n return list[0]\n elif list[0] < minimum(list[1:]):\n return list[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":8410,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:41:07","func_code":"def minimum(list):\n if len(list) == 1:\n return list[0]\n elif list[0] < minimum(list[1:]):\n return list[0]\n else:\n return minimum(list[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":7680,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:41:07","func_code":"def minimum(list):\n if len(list) == 1:\n return list[0]\n elif list[0] < minimum(list[1:]):\n return list[0]\n else:\n return minimum(list[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":16094,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 15:41:54","func_code":"def fibonacci(n):\n if n == 0 or 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":3471,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 15:42:08","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n < 0:\n return 0\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23011,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 15:42:08","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n < 0:\n return 0\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9746,"user":"05bf8435-64be-48cb-be81-139956827989","date":"2018-04-03 15:42:08","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n < 0:\n return 0\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34195,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 15:42:13","func_code":"def fibonacci(n):\n if n < 3:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":24577,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 15:42:23","func_code":"def fibonacci(n):\n if n < 3:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32384,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:42:35","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return reverse_list(l[1:]) + l[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":17924,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:42:35","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return reverse_list(l[1:]) + l[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":15633,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 15:43:01","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11043,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 15:43:01","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17926,"user":"70e78257-bdc0-4e89-b7cb-a49beaca5b77","date":"2018-04-03 15:43:01","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7205,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 15:43:58","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n < 3:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21303,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 15:44:08","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n < 3:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34246,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 15:44:08","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n < 3:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":24214,"user":"4a7eb3c1-23d7-4547-a3af-8d940245a9a3","date":"2018-04-03 15:44:08","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n < 3:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17846,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 15:45:27","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n else:\n return a[-1] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":30525,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:45:41","func_code":"def fibonacci(n):\n if n <= 2:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7079,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:45:56","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14274,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 15:45:56","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33439,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:45:56","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + s[1:]","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":19272,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:45:56","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36425,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:45:56","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5076,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:45:56","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":248,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 15:45:56","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34053,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:45:57","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":33378,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:45:57","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":13416,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:46:06","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":20376,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:46:06","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":34258,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:46:06","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":36433,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:46:06","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":6341,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:46:07","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":28091,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:46:07","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":2448,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:46:07","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":21409,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 15:46:38","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n return [l[-1]] + reverse_list(l[:-1])\n return reverse_list(a[a:])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":14511,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:46:45","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n <= 2:\n return n\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39962,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:46:45","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n <= 2:\n return n\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32072,"user":"d030c365-0c70-41fc-bf99-b5270c6b8c31","date":"2018-04-03 15:46:45","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n <= 2:\n return n\n else:\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25840,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 15:47:02","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":11923,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 15:47:02","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":15616,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-03 15:47:02","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":28589,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:47:07","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":19876,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:47:07","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":25488,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 15:47:31","func_code":"def sumup(n):\n if n == 1:\n return 1\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":27668,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 15:47:34","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n return []\n return reverse_list(nums[1:]) + nums[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":35456,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 15:47:34","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n return []\n return reverse_list(nums[1:]) + nums[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":7707,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 15:47:43","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":35758,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 15:47:43","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":11916,"user":"bb523aa9-260c-45a0-8676-45ed3ab261ee","date":"2018-04-03 15:47:43","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":34281,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 15:47:47","func_code":"def sumup(n):\n if n == 1:\n return 1\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":151,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 15:49:02","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":21095,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 15:49:02","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":19390,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:49:38","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":39187,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:49:38","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":5297,"user":"733076ff-a42d-4d8b-82c9-5fbbffc0c400","date":"2018-04-03 15:49:38","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30514,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 15:50:06","func_code":"def sumup(n):\n if n == 1:\n return 1\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":13319,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 15:50:25","func_code":"def sumup(x):\n x = x + sumup(x)\n return x","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":557,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 15:52:33","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sum_up_to(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":1747,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 15:52:50","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":39171,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:53:11","func_code":"def maximum(list):\n if len(list) == 1:\n return list[0]\n elif list[0] > maximum(list[1:]):\n return list[0]\n else:\n return maximum(list[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":16927,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:53:11","func_code":"def maximum(list):\n if len(list) == 1:\n return list[0]\n elif list[0] > maximum(list[1:]):\n return list[0]\n else:\n return maximum(list[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":20855,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-03 15:53:11","func_code":"def maximum(list):\n if len(list) == 1:\n return list[0]\n elif list[0] > maximum(list[1:]):\n return list[0]\n else:\n return maximum(list[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":25386,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:54:54","func_code":"def fibonacci(l):\n if fibonacci(0) == 1 and fibonacci(1) == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35464,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 15:55:09","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":19080,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:55:09","func_code":"def fibonacci(l):\n if fibonacci(0) == 1 or fibonacci(1) == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13128,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 15:55:35","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10238,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 15:55:35","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32698,"user":"e6a8cd93-4b6e-49db-8b16-a473b45b9a4a","date":"2018-04-03 15:55:35","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40964,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:55:37","func_code":"def fibonacci(l):\n if l == 1 or l == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27540,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 15:55:39","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":37019,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:55:55","func_code":"def fibonacci(l):\n if l == 1 or l == 1:\n return 1\n return fibonacci(l - 1) + fibonacci(l - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8030,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:56:21","func_code":"def fibonacci(l):\n if l == 0 or l == 1:\n return 1\n return fibonacci(l - 1) + fibonacci(l - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29223,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:56:21","func_code":"def fibonacci(l):\n if l == 0 or l == 1:\n return 1\n return fibonacci(l - 1) + fibonacci(l - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9640,"user":"09e5a143-ae3a-4611-8cfa-45d52e07b2c6","date":"2018-04-03 15:56:21","func_code":"def fibonacci(l):\n if l == 0 or l == 1:\n return 1\n return fibonacci(l - 1) + fibonacci(l - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":4549,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 15:56:42","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24774,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 15:56:48","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13639,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-03 15:56:48","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":904,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 15:56:58","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":39547,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 15:58:23","func_code":"def factorial(n):\n if n == 1:\n return 1\n prod_to_n_1 = factorial(n - 1)\n return n * prod_to_n_1","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":35511,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 15:58:26","func_code":"def sumup(n):\n if n > 0:\n n = n + sumup(n - 1)\n else:\n print(n)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":24573,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 15:59:04","func_code":"def sumup(n):\n n = int(n)\n if n > 0:\n n = n + sumup(n - 1)\n else:\n print(n)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":6701,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 15:59:22","func_code":"def sumup(n):\n n = int(n)\n if n > 0:\n n = n + sumup(n - 1)\n return n\n else:\n print(n)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":40642,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 15:59:28","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36152,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:00:07","func_code":"def sumup(n):\n n = int(n)\n if n > 0:\n n = n + sumup(n - 1)\n else:\n return n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":11466,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 16:00:25","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l[0]\n return new.append(reverse_list[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":31025,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 16:00:39","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l[0]\n return l.append(reverse_list[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":13574,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 16:00:40","func_code":"def reverse_list(a, new_a=None):\n if new_a == None:\n new_a = []\n if len(a) > 0:\n new_a.append(a.pop())\n return reverse_list(a, new_a)\n else:\n return new_a","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":13942,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 16:00:57","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l[0]\n return l.append(reverse_list(l[:-1]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":6423,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:01:03","func_code":"def factorial(n):\n return 1 if n < 1 else n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":37576,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:01:03","func_code":"def factorial(n):\n return 1 if n < 1 else n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":18947,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:01:21","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":10590,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:01:21","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":23709,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 16:01:38","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l[0]\n return l.append(reverse_list(l[:1]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":9595,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:03:18","func_code":"def factorial(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":17779,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:03:28","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":38351,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:03:28","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14247,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 16:03:30","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n biggest = a.pop()\n x = maximum(a)\n if biggest < x:\n biggest = x\n return biggest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":26185,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 16:03:30","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n biggest = a.pop()\n x = maximum(a)\n if biggest < x:\n biggest = x\n return biggest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":28582,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 16:04:04","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n smallest = a.pop(0)\n x = minimum(a)\n if smallest > minimum(a):\n smallest = x\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":38361,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 16:04:04","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n smallest = a.pop(0)\n x = minimum(a)\n if smallest > minimum(a):\n smallest = x\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":1128,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-03 16:04:04","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n smallest = a.pop(0)\n x = minimum(a)\n if smallest > minimum(a):\n smallest = x\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":18574,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 16:04:07","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l[0]\n new = reverse_list(l[1:]) + l[:1]\n return new","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":13124,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 16:04:32","func_code":"def reverse_list(l):\n if len(l) == 0:\n return 1\n new = reverse_list(l[1:]) + l[:1]\n return new","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":22457,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 16:04:47","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return 1\n new = reverse_list(l[1:]) + l[:1]\n return new","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":20501,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 16:04:54","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return l\n new = reverse_list(l[1:]) + l[:1]\n return new","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":1753,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 16:04:54","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return l\n new = reverse_list(l[1:]) + l[:1]\n return new","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":8695,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-03 16:04:54","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return l\n new = reverse_list(l[1:]) + l[:1]\n return new","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":18686,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 16:06:11","func_code":"def fibonacci(n):\n if n <= 1:\n return n\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":37354,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:06:59","func_code":"def power(n, p):\n print('Oopsie woopsie I did something wrong!')","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":35080,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 16:07:00","func_code":"def reverse_list(a, new_a=None):\n if new_a == None:\n new_a = []\n if len(a) > 0:\n new_a.append(a.pop())\n return reverse_list(a, new_a)\n else:\n return new_a","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":35877,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 16:07:00","func_code":"def reverse_list(a, new_a=None):\n if new_a == None:\n new_a = []\n if len(a) > 0:\n new_a.append(a.pop())\n return reverse_list(a, new_a)\n else:\n return new_a","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":32827,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 16:07:18","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14958,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-03 16:07:18","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28173,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 16:07:19","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = minimum(n[1:])\n return n[0] if n[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":19194,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 16:07:19","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = minimum(n[1:])\n return n[0] if n[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":27765,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-03 16:07:19","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = minimum(n[1:])\n return n[0] if n[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":36522,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:07:49","func_code":"def power(n, p):\n if p == 0:\n return 1\n if p == 1:\n return n\n return n ** p - 1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":2714,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:08:17","func_code":"def power(n, p):\n if p == 0:\n return 1\n if p == 1:\n return n + 1\n return n ** p - 1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":1455,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:09:16","func_code":"def sub_power(n, p):\n if p == 0:\n return 1\n if p == 1:\n return n\n return n ** p - 1\n\n\ndef power(n, p):\n\n def sub_power(n, p):\n if p == 0:\n return 1\n if p == 1:\n return n\n return n ** p - 1\n return sub_power(n, p) + 1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":33004,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:09:42","func_code":"def sub_power(n, p):\n if p == 0:\n return 1\n if p == 1:\n return n\n return n ** p - 1\n\n\ndef power(n, p):\n\n def sub_power(n, p):\n if p == 0:\n return 1\n if p == 1:\n return n\n return n ** p - 1\n if sub_power(n, p) + 1 == 1:\n return 2\n return sub_power(n, p) + 1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":34407,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:10:07","func_code":"def sub_power(n, p):\n if p == 0:\n return n\n if p == 1:\n return n\n return n ** p - 1\n\n\ndef power(n, p):\n\n def sub_power(n, p):\n if p == 0:\n return n\n if p == 1:\n return n\n return n ** p - 1\n return sub_power(n, p) + 1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":2420,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:10:15","func_code":"def sub_power(n, p):\n if p == 0:\n return p\n if p == 1:\n return n\n return n ** p - 1\n\n\ndef power(n, p):\n\n def sub_power(n, p):\n if p == 0:\n return p\n if p == 1:\n return n\n return n ** p - 1\n return sub_power(n, p) + 1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":3544,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:10:15","func_code":"def sub_power(n, p):\n if p == 0:\n return p\n if p == 1:\n return n\n return n ** p - 1\n\n\ndef power(n, p):\n\n def sub_power(n, p):\n if p == 0:\n return p\n if p == 1:\n return n\n return n ** p - 1\n return sub_power(n, p) + 1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":24054,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:11:32","func_code":"def power(x, y):\n if y == 0:\n return 1\n if y >= 1:\n return x * power(x, y - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":22027,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:11:32","func_code":"def power(x, y):\n if y == 0:\n return 1\n if y >= 1:\n return x * power(x, y - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":4066,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:18:08","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return min(l[0], minimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":11947,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:18:33","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] < a[1]:\n a.append(a[0])\n return minmum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":36248,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:19:28","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] < a[1]:\n a.append(a[0])\n return minimum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":218,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:19:28","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] < a[1]:\n a.append(a[0])\n return minimum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":28816,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:20:25","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > a[1]:\n a.append(a[0])\n return minimum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":39194,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:20:39","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > a[1]:\n a.append(a[0])\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":17904,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:20:39","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > a[1]:\n a.append(a[0])\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":20306,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:22:22","func_code":"def count_letters(s, i=0):\n if s != '':\n i += 1\n return count_letters(s[1:], i)\n else:\n return i","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":34628,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:22:22","func_code":"def count_letters(s, i=0):\n if s != '':\n i += 1\n return count_letters(s[1:], i)\n else:\n return i","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":872,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:24:50","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return min(l[0], minimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":28148,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:24:50","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return min(l[0], minimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":31445,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:25:23","func_code":"def reverse_list(a, b=[]):\n if len(b) != len(a):\n b.append(a[-1])\n return reverse_list(a[:-1], b)\n else:\n return b","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":22353,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:25:45","func_code":"def reverse_list(a, b=[]):\n if len(b) != len(a) and len(a) != 0:\n b.append(a[-1])\n return reverse_list(a[:-1], b)\n else:\n return b","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":40930,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:26:30","func_code":"def sumup(num):\n if num == 0:\n return 0\n return num + sumup(num - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":31696,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:26:30","func_code":"def sumup(num):\n if num == 0:\n return 0\n return num + sumup(num - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":41182,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:26:37","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return max(l[0], maximum(l[1:]))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":25439,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:26:37","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return max(l[0], maximum(l[1:]))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":3787,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:26:46","func_code":"def reverse_list(a):\n return a[::-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":8148,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:28:48","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7497,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:28:48","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":15615,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:30:53","func_code":"def power(n, p):\n if p == 0:\n return 1\n return power(n ** p)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":3389,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:33:36","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":12315,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:33:36","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":13875,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:33:37","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n ** p","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":26017,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:33:37","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n ** p","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":7305,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:39:04","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l[0]\n else:\n return l[::1], reverse_list(l[::1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":16872,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:40:43","func_code":"def minimum(l):\n if len(l) == 0:\n return 0\n lowest = 100\n for line in l:\n if line < lowest:\n lowest = line\n return minimum(lowest)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":15339,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:40:52","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1] + reverse_list(l[:-1])]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":28527,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:41:19","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":9591,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:41:19","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":40949,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:42:44","func_code":"def minimum(l):\n if l == []:\n return []\n lowest = 100\n for line in l:\n if line < lowest:\n lowest = line\n return minimum(lowest)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":7510,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:42:54","func_code":"def reverse_list(l):\n if not l:\n return l\n return l[-1:] + reverse(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":1478,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:43:06","func_code":"def reverse_list(l):\n if not l:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":31592,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:43:06","func_code":"def reverse_list(l):\n if not l:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":3154,"user":"7eb02a08-e561-4e33-a415-6df6cc4ff4a9","date":"2018-04-03 16:43:06","func_code":"def reverse_list(l):\n if not l:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":20481,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:43:11","func_code":"def minimum(l):\n print(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":33792,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:45:27","func_code":"def reverse_list(a):\n return a[::-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":28807,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:48:15","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n return [a[-1]] + reverse_list[:-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":4041,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:48:44","func_code":"def minimum(l):\n lowest = l[0]\n if l == []:\n return 0\n if l[0] < lowest:\n lowest = l[0]\n return minimum(l).pop(l[0])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":10265,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:48:49","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":2889,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:48:49","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":2289,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:51:12","func_code":"def minimum(l):\n lowest = 10000000000\n if l == []:\n return lowest\n if l[0] < lowest:\n lowest = l[0]\n return minimum(l[0]).pop","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":29960,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:51:40","func_code":"def minimum(l):\n lowest = 10000000000\n print(l[0])\n if l == []:\n return lowest\n if l[0] < lowest:\n lowest = l[0]\n return minimum(l[0]).pop","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":39641,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:52:10","func_code":"def minimum(l):\n lowest = 10000000000\n if l == []:\n return lowest\n if l < lowest:\n lowest = l[0]\n return minimum(l[0]).pop","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":25418,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:52:15","func_code":"def fibonacci(x):\n if x == 0:\n return 0\n elif x == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11374,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:52:24","func_code":"def minimum(l):\n lowest = 10000000000\n if l == []:\n return lowest\n if l[0] < lowest:\n lowest = l[0]\n return minimum(l[0]).pop","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":5976,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:52:33","func_code":"def fibonacci(x):\n if x == 0:\n return 0\n elif x == 1:\n return 1\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":9340,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:53:44","func_code":"def fibonacci(x):\n if x == 0:\n return 1\n elif x == 1:\n return 1\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40100,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:53:44","func_code":"def fibonacci(x):\n if x == 0:\n return 1\n elif x == 1:\n return 1\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":409,"user":"a998fa29-b3b1-437f-9555-da670b1ae43b","date":"2018-04-03 16:53:44","func_code":"def fibonacci(x):\n if x == 0:\n return 1\n elif x == 1:\n return 1\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33212,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:54:25","func_code":"def minimum(l):\n lowest = 10000000000\n if l == []:\n return lowest\n if int(l[0]) < lowest:\n lowest = l[0]\n return minimum(l[0]).pop","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":21722,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:54:49","func_code":"def minimum(l):\n lowest = 10000000000\n if l == []:\n return lowest\n if int(l[0]) < lowest:\n lowest = int(l[0])\n return minimum(l[0]).pop","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":34140,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:55:22","func_code":"def minimum(l):\n for line in l:\n print(line)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":7419,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:56:09","func_code":"def minimum(l):\n lowest = l[0]\n for line in l:\n if line < lowest:\n lowest = line\n return lowest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":28785,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 16:56:09","func_code":"def minimum(l):\n lowest = l[0]\n for line in l:\n if line < lowest:\n lowest = line\n return lowest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":37410,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:17:23","func_code":"def maximum(l):\n max = 0\n if len(l) == 1:\n return l[0]\n elif l[0] > l[1]:\n return maximum.pop(l[1])\n else:\n return maximum.pop(l[0])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":16938,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:17:54","func_code":"def maximum(l):\n max = 0\n if len(l) == 1:\n return l[0]\n elif l[0] > l[1]:\n return maximum(l).pop(l[1])\n else:\n return maximum(l).pop(l[0])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":14655,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:19:00","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n elif l[0] > l[1]:\n return maximum(l).pop(l[1])\n else:\n return maximum(l).pop(l[0])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":21903,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:20:06","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n elif l[0] > l[1]:\n return maximum(l.pop(l[1]))\n else:\n return maximum(l.pop(l[0]))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":16689,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:21:02","func_code":"def maximum(l):\n if len(l) == 0:\n return 0\n if len(l) == 1:\n return l[0]\n elif l[0] > l[1]:\n return maximum(l.pop(l[1]))\n else:\n return maximum(l.pop(l[0]))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":29175,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:22:42","func_code":"def maximum(l):\n max = 0\n if len(l) == 1:\n return l[0]\n elif l[0] > l[1]:\n return maximum(l).pop(l[1])\n else:\n return maximum(l).pop(l[0])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":39219,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:23:34","func_code":"def maximum(l):\n m = 0\n for line in l:\n if line > m:\n m = line\n return m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":34381,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:23:34","func_code":"def maximum(l):\n m = 0\n for line in l:\n if line > m:\n m = line\n return m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":32787,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:28:53","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n return count + 1, count_letters(s - s[0])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":21078,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:29:27","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n return count + 1, count_letters(s.remove[s[0]])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":30464,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:30:00","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n return count + 1, count_letters(s.replace[s[0], ''])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":36310,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:30:26","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n return count + 1, count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":23240,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:34:32","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n count + 1\n s = s - s[0]\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":37944,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:35:41","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n count + 1\n s = s - s[0]\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":17725,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-03 17:35:41","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n count + 1\n s = s - s[0]\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":11686,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 17:54:30","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":31853,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 17:54:59","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":5487,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 17:54:59","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":36749,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 17:55:46","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":517,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 17:55:46","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12210,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 18:08:40","func_code":"def minimum(li):\n if len(li) == 1:\n return li[0]\n if li[0] < li[-1]:\n li[-1] = li[0]\n return minimum(li[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":20901,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 18:08:40","func_code":"def minimum(li):\n if len(li) == 1:\n return li[0]\n if li[0] < li[-1]:\n li[-1] = li[0]\n return minimum(li[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":16144,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 18:09:31","func_code":"def maximum(li):\n if len(li) == 1:\n return li[0]\n if li[0] > li[-1]:\n li[-1] = li[0]\n return maximum(li[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":25930,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 18:09:31","func_code":"def maximum(li):\n if len(li) == 1:\n return li[0]\n if li[0] > li[-1]:\n li[-1] = li[0]\n return maximum(li[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":5532,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 18:13:34","func_code":"def count_letters(s, n=0):\n if len(s) == 0:\n return n\n return count_letters(s[1:], n + 1)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":5777,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 18:13:34","func_code":"def count_letters(s, n=0):\n if len(s) == 0:\n return n\n return count_letters(s[1:], n + 1)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":6675,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 18:26:35","func_code":"def reverse_list(li, n=0):\n if n == int(len(li) \/ 2):\n return li\n else:\n li[n], li[-n - 1] = li[-n - 1], li[n]\n return reverse_list(li, n + 1)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":2371,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 18:26:35","func_code":"def reverse_list(li, n=0):\n if n == int(len(li) \/ 2):\n return li\n else:\n li[n], li[-n - 1] = li[-n - 1], li[n]\n return reverse_list(li, n + 1)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":26528,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 18:44:41","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":2836,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 18:44:41","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22368,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 18:52:03","func_code":"def sumup(n):\n if n == 1:\n return\n sum_to_n = sumup(n - 1)\n return n + sum_to_n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":21836,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 18:55:22","func_code":"def sumup(n):\n if n == 1:\n return 1\n sum_to_n = sumup(n - 1)\n return n + sum_to_n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":6116,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 18:55:47","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n small = a[0]\n if small < minimum(a[1:]):\n return small\n else:\n return minimum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":11670,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 18:55:47","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n small = a[0]\n if small < minimum(a[1:]):\n return small\n else:\n return minimum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":18144,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 18:57:29","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n big = a[0]\n if big > maximum(a[1:]):\n return big\n else:\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":16759,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 18:57:29","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n big = a[0]\n if big > maximum(a[1:]):\n return big\n else:\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":8777,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-03 18:57:29","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n big = a[0]\n if big > maximum(a[1:]):\n return big\n else:\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":5436,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 18:58:38","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7370,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 18:59:27","func_code":"def factorial(n):\n if n < 2:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":21900,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 18:59:27","func_code":"def factorial(n):\n if n < 2:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":33553,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 18:59:48","func_code":"def sumup(n):\n if n < 2:\n return 1\n sum_to_n = sumup(n - 1)\n return n + sum_to_n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":1764,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 19:00:36","func_code":"def sumup(n):\n if n < 2:\n return n\n sum_to_n = sumup(n - 1)\n return n + sum_to_n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":4684,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 19:00:36","func_code":"def sumup(n):\n if n < 2:\n return n\n sum_to_n = sumup(n - 1)\n return n + sum_to_n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":11930,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 19:07:25","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":21500,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 19:07:25","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":30397,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 19:10:47","func_code":"def fibonacci(n, older=0, old=1):\n if n == 0:\n return old\n return fibonacci(n - 1, old, older + old)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30127,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 19:10:47","func_code":"def fibonacci(n, older=0, old=1):\n if n == 0:\n return old\n return fibonacci(n - 1, old, older + old)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33126,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 19:15:54","func_code":"def minimum(l):\n if len(l) == 1:\n return l\n f, m = l[0], minimum(l[1:])\n if f < m:\n return f\n else:\n return m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":18762,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 19:15:54","func_code":"def minimum(l):\n if len(l) == 1:\n return l\n f, m = l[0], minimum(l[1:])\n if f < m:\n return f\n else:\n return m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":32790,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-03 19:15:54","func_code":"def minimum(l):\n if len(l) == 1:\n return l\n f, m = l[0], minimum(l[1:])\n if f < m:\n return f\n else:\n return m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":6333,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-03 19:21:33","func_code":"def sumup(n):\n if n == 1:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":34555,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-03 19:22:13","func_code":"def factorial(n):\n if n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":15790,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-03 19:38:54","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":31523,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-03 19:38:54","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":39247,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-03 19:39:02","func_code":"def factorial(n):\n if n == 0:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":19970,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-03 19:40:39","func_code":"def factorial(n):\n if n == 0:\n return n + 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14240,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-03 19:40:39","func_code":"def factorial(n):\n if n == 0:\n return n + 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":8848,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-03 19:40:43","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":38028,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-03 19:40:43","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":12319,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-03 19:40:43","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17047,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 22:21:57","func_code":"def power(m, n):\n if n < 1:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":21041,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 22:21:57","func_code":"def power(m, n):\n if n < 1:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":11850,"user":"f565987c-8fbf-4b95-b405-cf1a3ccac8f5","date":"2018-04-03 22:21:57","func_code":"def power(m, n):\n if n < 1:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":14970,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-03 23:18:10","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":22313,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-03 23:19:11","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":28298,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-03 23:19:11","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":20803,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-03 23:20:08","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":38055,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-03 23:21:06","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":39011,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-03 23:21:06","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":18600,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-03 23:33:36","func_code":"def power(m, n):\n if m == 1:\n return 1\n return m ** power(m, n)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":13933,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-03 23:33:36","func_code":"def power(m, n):\n if m == 1:\n return 1\n return m ** power(m, n)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":30983,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-03 23:33:36","func_code":"def power(m, n):\n if m == 1:\n return 1\n return m ** power(m, n)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":41168,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-04 09:43:03","func_code":"def minimum(l):\n if len(l) == 1:\n return l\n else:\n return mini(l[0], minimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":11723,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-04 09:43:03","func_code":"def minimum(l):\n if len(l) == 1:\n return l\n else:\n return mini(l[0], minimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":41583,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-04 09:43:03","func_code":"def minimum(l):\n if len(l) == 1:\n return l\n else:\n return mini(l[0], minimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":14969,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-04 11:15:42","func_code":"def power(a, b):\n return a ** b","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":31726,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-04 11:15:42","func_code":"def power(a, b):\n return a ** b","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":6894,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-04 11:15:42","func_code":"def power(a, b):\n return a ** b","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":33304,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-04 13:07:32","func_code":"def count_letters(s):\n total = 0\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":2215,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-04 13:07:32","func_code":"def count_letters(s):\n total = 0\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":4141,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:12:37","func_code":"def sumup(n):\n if n == 1:\n return 1\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":22543,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:13:29","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":17271,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:14:00","func_code":"def sumup(n):\n if n == 1:\n return 1\n else:\n return n * sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":6374,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:14:15","func_code":"def sumup(n):\n if n == 0:\n return 1\n else:\n return n * sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":34113,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:14:59","func_code":"def sumup(n):\n print(n)\n if n == 0:\n return 1\n else:\n return n * sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":27724,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:15:35","func_code":"def sumup(n):\n if n == 0:\n return 1\n else:\n return n * sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":27469,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:15:57","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n * sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":15992,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:16:07","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":22037,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:16:07","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":15356,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:17:03","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n return n * sumup(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22569,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:17:22","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36184,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:17:22","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12798,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:19:17","func_code":"def power(n, p):\n if p == 1:\n return n\n else:\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":8282,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:20:20","func_code":"def power(n, p):\n if p == 0:\n return 1\n if p == 1:\n return n\n else:\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":23710,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:20:20","func_code":"def power(n, p):\n if p == 0:\n return 1\n if p == 1:\n return n\n else:\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":25304,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:24:46","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n l = min(l[0], miminum(l[1:]))\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":17780,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:25:00","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n l = min(l[0], mininum(l[1:]))\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":22829,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:25:14","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n l = min(l[0], minimum(l[1:]))\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":37414,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:25:14","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n l = min(l[0], minimum(l[1:]))\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":4779,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:26:22","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n l = max(l[0], maximum(l[1:]))\n return l","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":25126,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:26:22","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n l = max(l[0], maximum(l[1:]))\n return l","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":32802,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:30:57","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s.replace(s[0], '', 1))","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":22565,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:30:57","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s.replace(s[0], '', 1))","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":13451,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:36:07","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n else:\n return reverse_list(l[1:]).append(l.pop(s[0]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":13370,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:36:18","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n else:\n return reverse_list(l[1:]).append(l.pop(l[0]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":23470,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:36:53","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n else:\n return reverse_list(l[1:]).append(l.pop(0))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":37820,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:37:44","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return reverse_list(l[1:]).append(l.pop(0))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":14999,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:38:32","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n l = reverse_list(l[1:]) + l.pop(0)\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":35922,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:38:55","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n l = reverse_list(l[1:]) + list(l.pop(0))\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":12106,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:46:27","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n else:\n j = l.pop(0)\n return reverse_list(l).append(j)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":21210,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 13:47:05","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n else:\n j = list(l.pop(0))\n return reverse_list(l) + j","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":22828,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-04 16:23:55","func_code":"def reverse_list(a):\n if a == []:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":11728,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-04 16:23:55","func_code":"def reverse_list(a):\n if a == []:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":15780,"user":"7d63d843-7e5d-4c24-a378-1056c311dfd2","date":"2018-04-04 16:23:55","func_code":"def reverse_list(a):\n if a == []:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":14735,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:32:37","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":1388,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:33:24","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":2435,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:33:24","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":25768,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:34:49","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":38732,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:35:06","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24776,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:35:06","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":16391,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:38:18","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":14576,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:38:18","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":1276,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:41:36","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[n + 1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":956,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:41:36","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[n + 1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":5729,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:44:26","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] >= maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[n + 1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":35526,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:44:26","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] >= maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[n + 1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":24891,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:46:46","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":17005,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:46:46","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":22580,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-04 16:48:24","func_code":"def count_letters(s, i=0):\n i += 1\n if i == len(s):\n return 1\n if len(s) > 0:\n return 1 + count_letters(s, i)\n else:\n return 0","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":40165,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-04 16:48:24","func_code":"def count_letters(s, i=0):\n i += 1\n if i == len(s):\n return 1\n if len(s) > 0:\n return 1 + count_letters(s, i)\n else:\n return 0","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":17948,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-04 16:48:24","func_code":"def count_letters(s, i=0):\n i += 1\n if i == len(s):\n return 1\n if len(s) > 0:\n return 1 + count_letters(s, i)\n else:\n return 0","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":6532,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:48:44","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":35519,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:48:44","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":29642,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:51:52","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36118,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:51:52","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26277,"user":"198db91d-9bcb-463c-838e-d8957f078a4a","date":"2018-04-04 16:51:52","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7724,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-04 17:33:47","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n m = maximum(n[1:])\n return n[0] if n[0] > m else m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":39781,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-04 17:33:47","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n m = maximum(n[1:])\n return n[0] if n[0] > m else m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":5125,"user":"00ee78cc-7a00-47a7-85bb-9c524dad656c","date":"2018-04-04 17:33:47","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n m = maximum(n[1:])\n return n[0] if n[0] > m else m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":4514,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 18:48:45","func_code":"def sumup(n):\n sum = 0\n for x in range(0, n):\n sum += x\n return sum","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":9781,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 18:49:06","func_code":"def sumup(n):\n sum = 0\n for x in range(0, n + 1):\n sum += x\n return sum","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":21059,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 18:53:19","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":14101,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 18:53:19","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":30288,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 18:54:24","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":6758,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 18:58:01","func_code":"def factorial(n):\n product = 1\n for x in range(0, n + 1):\n product *= x\n return product","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":42146,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 18:58:24","func_code":"def factorial(n):\n product = 1\n for x in range(1, n + 1):\n product *= x\n return product","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":28631,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 18:59:35","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":13760,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:00:19","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40230,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:02:03","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":15798,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:05:35","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":34904,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:05:35","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":16357,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:10:26","func_code":"def minimum(l):\n min = 10000000000\n for x in l:\n if x < min:\n min = x\n return min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":7883,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:10:26","func_code":"def minimum(l):\n min = 10000000000\n for x in l:\n if x < min:\n min = x\n return min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":2059,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:19:51","func_code":"def power(m, n):\n if n == 0:\n return m\n m *= n\n return power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":41716,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:20:50","func_code":"def power(m, n):\n if n == 0:\n return m\n m *= m\n return power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":32271,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:21:26","func_code":"def power(m, n):\n if n == 0:\n return m\n m = m * m\n return power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":27731,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:22:04","func_code":"def power(m, n):\n if n == 0:\n return m\n m = m ** 2\n return power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":26154,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:22:31","func_code":"def power(m, n):\n if n == 1:\n return m\n m = m ** 2\n return power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":2492,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:23:50","func_code":"def power(m, n):\n if n == 0:\n return m\n new = m * m\n return new","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":18284,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:25:00","func_code":"def power(m, n):\n if n == 0:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":23783,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:25:22","func_code":"def power(m, n):\n if n == 1:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":15196,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:26:05","func_code":"def power(m, n):\n if n == 0:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":27711,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:26:05","func_code":"def power(m, n):\n if n == 0:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":30468,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-04 19:26:05","func_code":"def power(m, n):\n if n == 0:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":28300,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-04 19:34:37","func_code":"def count_letters(s):\n if s == '':\n return 0\n s = s.replace(s[-1], '', 1)\n return count_letters(s) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":39874,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-04 19:34:37","func_code":"def count_letters(s):\n if s == '':\n return 0\n s = s.replace(s[-1], '', 1)\n return count_letters(s) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":6173,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 20:06:20","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":36948,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 20:06:20","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":7820,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 20:17:26","func_code":"def factorial(n):\n if n <= 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":26839,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 20:17:26","func_code":"def factorial(n):\n if n <= 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":37952,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 20:20:46","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":35522,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 20:20:46","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":13739,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 20:27:46","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n else:\n return reverse_list(l) + list(l.pop(0))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":40535,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 20:28:45","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n else:\n return list(l.pop(0)) + reverse_list(l)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":39971,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 20:29:36","func_code":"def reverse_list(l):\n if len(l) == 2:\n return l\n else:\n return list(l.pop(0)) + reverse_list(l)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":33207,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 20:29:36","func_code":"def reverse_list(l):\n if len(l) == 2:\n return l\n else:\n return list(l.pop(0)) + reverse_list(l)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":34165,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 20:35:41","func_code":"def fibonacci(n):\n num_one = 0\n num_two = 1\n while i < n:\n num_two = num_two + num_one\n num_one = num_two - num_one\n i = i + 1\n return num_two","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10851,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 20:36:08","func_code":"def fibonacci(n):\n num_one = 0\n num_two = 1\n i = 0\n while i < n:\n num_two = num_two + num_one\n num_one = num_two - num_one\n i = i + 1\n return num_two","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8077,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 20:36:08","func_code":"def fibonacci(n):\n num_one = 0\n num_two = 1\n i = 0\n while i < n:\n num_two = num_two + num_one\n num_one = num_two - num_one\n i = i + 1\n return num_two","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20692,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-04 20:36:08","func_code":"def fibonacci(n):\n num_one = 0\n num_two = 1\n i = 0\n while i < n:\n num_two = num_two + num_one\n num_one = num_two - num_one\n i = i + 1\n return num_two","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16422,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-04 20:38:53","func_code":"def power(n, p):\n if n == 0:\n return 0\n return n ** power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":1057,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-04 20:39:33","func_code":"def power(n, p):\n if p == 0:\n return 0\n return n ** power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":40916,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-04 20:46:36","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":39708,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-04 20:46:36","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":34771,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-04 20:46:36","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":5522,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 20:51:30","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n elif l[0] < l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":11091,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 20:51:30","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n elif l[0] < l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":34003,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 20:53:29","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n elif l[0] > l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":24716,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 20:53:29","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n elif l[0] > l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":11460,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 21:03:20","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":15875,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 21:03:20","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":9106,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 21:30:35","func_code":"def reverse_list(l, l1=None):\n if l1 is None:\n l1 = []\n if l == []:\n return l1\n l1.append(l[-1])\n return reverse_list(l[:-1], l1)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30051,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 21:30:35","func_code":"def reverse_list(l, l1=None):\n if l1 is None:\n l1 = []\n if l == []:\n return l1\n l1.append(l[-1])\n return reverse_list(l[:-1], l1)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":5409,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-04 21:39:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37714,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-04 21:39:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25210,"user":"8d21baf9-a7ac-4132-92e0-a1002f0c04a9","date":"2018-04-04 21:39:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25942,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-04 21:41:14","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":4305,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-04 21:41:14","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36704,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-04 21:41:14","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7110,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 21:48:19","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17308,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 21:48:19","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":42476,"user":"fc726678-a7a5-405b-bc49-844b42ef4a2b","date":"2018-04-04 21:48:19","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30693,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-04 23:20:22","func_code":"def sumup(n):\n if n == 1:\n return 1\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":31181,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-04 23:20:22","func_code":"def sumup(n):\n if n == 1:\n return 1\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":34387,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-04 23:20:22","func_code":"def sumup(n):\n if n == 1:\n return 1\n sum_to_n_1 = sumup(n - 1)\n return n + sum_to_n_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":1970,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 10:38:05","func_code":"def count_letters(s):\n if s == '':\n return 0\n elif s != '':\n s = list(s)\n s.pop()\n count += 1\n count_letters(s.join())\n else:\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":18151,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 10:38:30","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return 0\n elif s != '':\n s = list(s)\n s.pop()\n count += 1\n count_letters(s.join())\n else:\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":21045,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 10:39:40","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return 0\n elif s != '':\n s = list(s)\n s.pop()\n count += 1\n count_letters(''.join(s))\n else:\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":32326,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 10:40:17","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return 0\n elif s != '':\n s = list(s)\n s.pop()\n count += 1\n return count_letters(''.join(s))\n else:\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":24804,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-05 10:47:33","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return count_letters(s[:-1]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":786,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-05 10:47:33","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return count_letters(s[:-1]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":33646,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-05 10:49:43","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n f, m = l[0], minimum(l[1:])\n if f < m:\n return f\n else:\n return m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41362,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-05 10:49:43","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n f, m = l[0], minimum(l[1:])\n if f < m:\n return f\n else:\n return m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12413,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-05 10:49:43","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n f, m = l[0], minimum(l[1:])\n if f < m:\n return f\n else:\n return m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":18471,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 11:06:09","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n elif s != '':\n s = list(s)\n s.pop()\n \"\"\"\"\"\".join(s)\n count += 0\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":27032,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 11:14:01","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n elif s != '':\n s = list(s)\n s.pop()\n \"\"\"\"\"\".join(s)\n print(count)\n count += 1\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":26321,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 11:31:04","func_code":"def reverse_list(l):\n if l == []:\n return []\n elif len(l) == 1:\n return l\n else:\n return reverse_list(l[1:]).append(l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":40977,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 11:46:55","func_code":"def reverse_list(l):\n if l == []:\n return []\n elif len(l) == 1:\n return l\n else:\n return reverse_list(l[-1:]).append(l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":4755,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 11:54:16","func_code":"def reverse_list(l):\n if l == []:\n return []\n elif len(l) == 1:\n return l\n else:\n return reverse_list(l[-1:]).append(l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":22325,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 12:00:49","func_code":"def reverse_list(l):\n if l == []:\n return []\n elif len(l) == 1:\n return l\n else:\n return reverse_list(l[len(l) - 2:]).append(l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":41197,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-05 12:30:58","func_code":"def power(m, n):\n if n == 0:\n return m\n m = m * m\n return power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":11340,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-05 12:32:08","func_code":"def power(m, n):\n if n == 0:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":3924,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 12:34:44","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":4312,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 12:35:26","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34741,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 12:35:26","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36819,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 12:41:11","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n elif s != '':\n s = list(s)\n s.pop()\n \"\"\"\"\"\".join(s)\n count += 1\n return count_letters(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":24957,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-05 12:41:56","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n - sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":8891,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-05 12:44:29","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":31474,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-05 12:44:29","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":20199,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-05 12:46:30","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36107,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-05 12:46:58","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14055,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-05 12:47:16","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":11707,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-05 12:47:16","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":39498,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 12:51:25","func_code":"def count_letters(s):\n s = list(s)\n if s == []:\n return 0\n else:\n count = 0\n for c in s:\n count += 1\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":38558,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 12:51:25","func_code":"def count_letters(s):\n s = list(s)\n if s == []:\n return 0\n else:\n count = 0\n for c in s:\n count += 1\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":11083,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-05 12:52:23","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m ** power(n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":19108,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 12:59:42","func_code":"def reverse_list(l):\n if l == []:\n return []\n else:\n return reverse_list(l[1:]).append(l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":37045,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 13:00:12","func_code":"def reverse_list(l):\n if l == []:\n return []\n else:\n return list(reverse_list(l[1:])).append(l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":24278,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 13:02:04","func_code":"def reverse_list(l):\n if l == []:\n return []\n elif len(l) == 1:\n return l\n else:\n return reverse_list(l[1:]).append(l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":30190,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 13:02:04","func_code":"def reverse_list(l):\n if l == []:\n return []\n elif len(l) == 1:\n return l\n else:\n return reverse_list(l[1:]).append(l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":40120,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-05 13:02:04","func_code":"def reverse_list(l):\n if l == []:\n return []\n elif len(l) == 1:\n return l\n else:\n return reverse_list(l[1:]).append(l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":22044,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-05 13:41:00","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return l\n else:\n return reverse_list(l[1:]) + l[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":32993,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-05 13:42:21","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return l\n else:\n return reverse_list(l[1:]) + l[0]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":37893,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-05 13:42:33","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return l\n else:\n return reverse_list(l[1:]) + l[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":8943,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-05 13:43:15","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n else:\n return reverse_list(l[1:]) + l[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":38184,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-05 13:43:15","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n else:\n return reverse_list(l[1:]) + l[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":40087,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-05 13:43:15","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n else:\n return reverse_list(l[1:]) + l[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":34725,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-05 13:53:10","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36762,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-05 13:53:10","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27727,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-05 13:59:14","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = minimum(n[1:])\n return n[0] if n[0] > min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":14211,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-05 13:59:14","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = minimum(n[1:])\n return n[0] if n[0] > min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":24086,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-05 14:00:19","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = minimum(n[1:])\n return n[0] if n[0] > min_ret else min_ret","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":17714,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-05 14:00:32","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = maximum(n[1:])\n return n[0] if n[0] > min_ret else min_ret","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":18186,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-05 14:00:32","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = maximum(n[1:])\n return n[0] if n[0] > min_ret else min_ret","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":29361,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-05 14:02:06","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":490,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-05 14:02:06","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18835,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-05 14:09:05","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":12123,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-05 14:09:05","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":5517,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:13:45","func_code":"def sumup(x):\n if x == 0:\n return 0\n return x + sumup(x - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":19162,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-05 14:15:15","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":37151,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-05 14:15:15","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":33676,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:15:54","func_code":"def factorial(x):\n if x == 1:\n return 1\n return x * factorial(x - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7275,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-05 14:16:20","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":14125,"user":"6a72520c-4c39-4c03-b7cf-5550dbde3147","date":"2018-04-05 14:16:20","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":25223,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:16:27","func_code":"def sumup(x):\n if x == 0:\n return 0\n return x + sumup(x - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":31676,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:16:27","func_code":"def sumup(x):\n if x == 0:\n return 0\n return x + sumup(x - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":16940,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:16:37","func_code":"def factorial(x):\n if x == 1:\n return 1\n return x * factorial(x - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12270,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:17:30","func_code":"def factorial(x):\n if x == 0:\n return 0\n if x == 1:\n return 1\n return x * factorial(x - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":1760,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:17:58","func_code":"def factorial(x):\n if x >= 1:\n return 1\n return x * factorial(x - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":30149,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:18:19","func_code":"def factorial(x):\n if x <= 1:\n return 1\n return x * factorial(x - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":19151,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:18:19","func_code":"def factorial(x):\n if x <= 1:\n return 1\n return x * factorial(x - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":16042,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:19:08","func_code":"def power(x, y):\n return x ** y","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":24985,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:19:08","func_code":"def power(x, y):\n return x ** y","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":41984,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:20:12","func_code":"def minimum(x):\n return min(x)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":10930,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:20:12","func_code":"def minimum(x):\n return min(x)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":13426,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:21:28","func_code":"def maximum(x):\n return max(x)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":24661,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:21:28","func_code":"def maximum(x):\n return max(x)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":30002,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-05 14:22:36","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n return maximum(a.remove(min(a)))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":4000,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-05 14:24:56","func_code":"def maximum(a):\n if len(a) == 1:\n return list(a[0])\n return maximum(a.remove(min(a)))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":38995,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-05 14:24:56","func_code":"def maximum(a):\n if len(a) == 1:\n return list(a[0])\n return maximum(a.remove(min(a)))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":17650,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:25:29","func_code":"def count_letters(x):\n return len(x)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":21124,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:25:29","func_code":"def count_letters(x):\n return len(x)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":15811,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:26:54","func_code":"def reverse_list(x):\n return x[::-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":38177,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:26:54","func_code":"def reverse_list(x):\n return x[::-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":13273,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 14:28:13","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":33773,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 14:28:13","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":17024,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 14:30:11","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":34760,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 14:31:34","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":6267,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 14:31:34","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":4183,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 14:33:49","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":20811,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 14:33:49","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":20372,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 14:34:43","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":1431,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 14:34:43","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32765,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 14:36:30","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20676,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 14:38:27","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24199,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-05 14:38:52","func_code":"def fibonacci(m):\n if m == 1 or m == 0:\n return 1\n return fibonacci(m - 1) + fibonacci(m - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20048,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-05 14:38:52","func_code":"def fibonacci(m):\n if m == 1 or m == 0:\n return 1\n return fibonacci(m - 1) + fibonacci(m - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17236,"user":"e65c3029-39bf-4873-8e7a-599cb24be899","date":"2018-04-05 14:38:52","func_code":"def fibonacci(m):\n if m == 1 or m == 0:\n return 1\n return fibonacci(m - 1) + fibonacci(m - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18956,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:39:59","func_code":"def fibonacci(x):\n if x == 0:\n return 1\n elif x == 1:\n return 1\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21051,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:39:59","func_code":"def fibonacci(x):\n if x == 0:\n return 1\n elif x == 1:\n return 1\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":4562,"user":"c0d569cd-4374-4e65-8e98-e814031fb3ca","date":"2018-04-05 14:39:59","func_code":"def fibonacci(x):\n if x == 0:\n return 1\n elif x == 1:\n return 1\n else:\n return fibonacci(x - 1) + fibonacci(x - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32979,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 14:40:46","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":34018,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 14:42:23","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n smallest = minimum(a[1:])\n if a[0] < smallest:\n smallest = a[0]\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":40300,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 14:42:23","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n smallest = minimum(a[1:])\n if a[0] < smallest:\n smallest = a[0]\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":9972,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 14:43:40","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n biggest = maximum(a[1:])\n if a[0] > biggest:\n biggest = a[0]\n return biggest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":23263,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 14:43:40","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n biggest = maximum(a[1:])\n if a[0] > biggest:\n biggest = a[0]\n return biggest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":25252,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 14:43:55","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":11554,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 14:44:38","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":34396,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 14:45:33","func_code":"def sumup(n):\n if n == 1:\n return 1\n if n != 0:\n return n + sumup(n - 1)\n else:\n return 0","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":16037,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 14:45:33","func_code":"def sumup(n):\n if n == 1:\n return 1\n if n != 0:\n return n + sumup(n - 1)\n else:\n return 0","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":29221,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 14:47:33","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":2172,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 14:47:33","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12574,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 14:49:04","func_code":"def power(m, n):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":9562,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 14:49:19","func_code":"def power(m, n):\n if m == 0:\n return 1\n return n * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":2884,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 14:50:08","func_code":"def power(m, n):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":20732,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 14:50:28","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":39792,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 14:50:28","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":34385,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-05 14:51:32","func_code":"def power(m, n):\n if n == 0:\n return 1\n if n == 1:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":3302,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-05 14:51:32","func_code":"def power(m, n):\n if n == 0:\n return 1\n if n == 1:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":6282,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-05 14:51:32","func_code":"def power(m, n):\n if n == 0:\n return 1\n if n == 1:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":861,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 14:53:40","func_code":"def power(n, e):\n if e == 0:\n return 1\n return n * power(n, e - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":34747,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 14:53:40","func_code":"def power(n, e):\n if e == 0:\n return 1\n return n * power(n, e - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":16456,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:00:17","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] < minimum(a[1:]):\n return a[0]\n else:\n return minimum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":6474,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:00:17","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] < minimum(a[1:]):\n return a[0]\n else:\n return minimum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":30734,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 15:01:41","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32476,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 15:01:41","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":25767,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:02:16","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > maximum(a[1:]):\n return a[0]\n else:\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":24738,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:02:16","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > maximum(a[1:]):\n return a[0]\n else:\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":28462,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-05 15:03:14","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m ** power(n, e - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":32742,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-05 15:03:14","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m ** power(n, e - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":28493,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 15:07:31","func_code":"def minimum(l):\n return min(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":20757,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 15:07:31","func_code":"def minimum(l):\n return min(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":40980,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-05 15:07:43","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":28508,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-05 15:10:12","func_code":"def factorial(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":1277,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-05 15:11:15","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":11444,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-05 15:11:15","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":19221,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:14:34","func_code":"def count_letters(word):\n if word == '':\n return 0\n return 1 + count_letters(word[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":33822,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:14:34","func_code":"def count_letters(word):\n if word == '':\n return 0\n return 1 + count_letters(word[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":23375,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 15:16:02","func_code":"def maximum(l):\n return max(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":32755,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 15:16:02","func_code":"def maximum(l):\n return max(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":26884,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 15:16:18","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < l[1]:\n l.remove(l[1])\n elif l[0] > l[1]:\n l.remove(l[0])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12282,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 15:17:09","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > l[1]:\n l.remove(l[1])\n elif l[0] < l[1]:\n l.remove(l[0])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":3592,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 15:17:24","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < l[1]:\n l.remove(l[1])\n elif l[0] > l[1]:\n l.remove(l[0])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":25618,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 15:17:24","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < l[1]:\n l.remove(l[1])\n elif l[0] > l[1]:\n l.remove(l[0])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":2914,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 15:18:20","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":39655,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 15:18:39","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > l[1]:\n l.remove(l[1])\n elif l[0] < l[1]:\n l.remove(l[0])\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":19351,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 15:18:39","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > l[1]:\n l.remove(l[1])\n elif l[0] < l[1]:\n l.remove(l[0])\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":5998,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 15:21:04","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20532,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-05 15:21:04","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40393,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:21:47","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a[0]\n return a[-1] + reverse_list(a[::-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":30870,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 15:26:38","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":20702,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 15:26:38","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":8358,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-05 15:26:38","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":14754,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:28:14","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a[0]\n return [a[-1]] + reverse_list(a[::-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":37756,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:28:27","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a[0]\n return [a[:-1]] + reverse_list(a[::-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":33949,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:28:38","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a[0]\n return [a[:-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":37077,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:29:07","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n return [a[:-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":12746,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:29:41","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":16743,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:29:41","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30352,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-05 15:29:41","func_code":"def reverse_list(a):\n if len(a) == 1 or len(a) == 0:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":41419,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 15:35:21","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":28853,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 15:35:21","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":33636,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 15:39:54","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39471,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 15:39:54","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9143,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-05 15:39:54","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":42123,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-05 16:40:53","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":25342,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-05 16:53:01","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":25054,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-05 16:53:01","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":9511,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-05 16:53:01","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":35121,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-06 10:05:39","func_code":"def fibonacci(n):\n if n == 0 and n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37262,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-06 10:05:58","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6297,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-06 10:05:58","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5419,"user":"bda058db-eb82-407a-b3b2-8f24355f1fa5","date":"2018-04-06 10:05:58","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16092,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-06 13:34:47","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[-2] < a[-1]:\n return minimum(a[:-1])\n else:\n return minimum(a[:-2] + a[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":107,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-06 13:34:47","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[-2] < a[-1]:\n return minimum(a[:-1])\n else:\n return minimum(a[:-2] + a[-1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":11479,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:12:25","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":36618,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:12:25","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":24681,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:14:02","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n + factorial(n)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":37094,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:14:31","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n + factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":27059,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:15:13","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":32378,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:15:41","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":33657,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:15:41","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":39319,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:20:34","func_code":"def power(x, y):\n if y == 1:\n return x\n return x * power(x, y - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":17189,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:20:55","func_code":"def power(x, y):\n if y == 0:\n return 1\n return x * power(x, y - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":36487,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:20:55","func_code":"def power(x, y):\n if y == 0:\n return 1\n return x * power(x, y - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":11127,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:30:00","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n min_a, min_b = l[0], minimum(l[1:])\n if min_a > min_b:\n min_a = min_b\n return min_a","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":2213,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:30:00","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n min_a, min_b = l[0], minimum(l[1:])\n if min_a > min_b:\n min_a = min_b\n return min_a","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41205,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:31:50","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n max_a, max_b = l[0], maximum(l[1:])\n if max_a < max_b:\n max_a = max_b\n return max_a","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":42302,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:31:50","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n max_a, max_b = l[0], maximum(l[1:])\n if max_a < max_b:\n max_a = max_b\n return max_a","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":32921,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:47:39","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":13663,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 16:47:39","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":3225,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 17:08:18","func_code":"def reverse_list(l):\n if not l:\n return []\n return [l.pop()] + reverse_list(l)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":17563,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 17:08:18","func_code":"def reverse_list(l):\n if not l:\n return []\n return [l.pop()] + reverse_list(l)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":20187,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 17:15:41","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26593,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 17:15:41","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7907,"user":"a8d7ba55-2066-48ff-a791-991413f703dc","date":"2018-04-06 17:15:41","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10341,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:07:18","func_code":"def count_letters(s):\n count = 0\n while s[i] != '':\n count += 1\n return count_letters(s)\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":1737,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:07:42","func_code":"def count_letters(s):\n count = 0\n i = 0\n while s[i] != '':\n count += 1\n i += 1\n return count_letters(s)\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":31319,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:08:13","func_code":"def count_letters(s):\n count = 0\n for x in s:\n count += 1\n return count_letters(s)\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":10252,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:08:45","func_code":"def count_letters(s):\n count = 0\n for x in s:\n count += 1\n return count_letters(s[1:])\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":28291,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:11:40","func_code":"def count_letters(s):\n if s == '':\n return count\n count = 0\n count += 1\n return count_letters(s[1:])\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":4835,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:17:07","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n count = 0\n count += 1\n return count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":14216,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:17:39","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n count += 1\n return count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":7967,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:18:35","func_code":"def count_letters(s):\n if s == '':\n return count\n else:\n count += 1\n return count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":24544,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:25:20","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":368,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:25:20","func_code":"def count_letters(s):\n count = 0\n if s == '':\n return count\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":37597,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-06 20:27:42","func_code":"def sumup(n):\n return sum(list(range(n))) + n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":14813,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-06 20:27:42","func_code":"def sumup(n):\n return sum(list(range(n))) + n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":9373,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-06 20:27:42","func_code":"def sumup(n):\n return sum(list(range(n))) + n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":38705,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:31:39","func_code":"def reverse_list(l):\n if len(l) == reverse_list():\n return l\n return 1 + reverse_list(l[-1] + l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":34432,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:31:58","func_code":"def reverse_list(l):\n if len(l) == reverse_list(l):\n return l\n return 1 + reverse_list(l[-1] + l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":33472,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:32:31","func_code":"def reverse_list(l):\n return reverse_list(l[-1] + l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":18483,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:33:29","func_code":"def reverse_list(l):\n return l[-1] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":2617,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 20:34:09","func_code":"def reverse_list(l):\n return l.reverse()","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":13496,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 21:58:12","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30088,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 21:58:12","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":16571,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 22:04:34","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8072,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 22:04:34","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15418,"user":"24b328b2-2b24-43bc-9468-d9ba1d7df521","date":"2018-04-06 22:04:34","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16542,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:35:58","func_code":"def factorial(n):\n return product(list(range(n))) * n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22994,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:36:25","func_code":"def factorial(n=0):\n return product(list(range(n))) * n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":11877,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:39:36","func_code":"def factorial(n=0):\n return math.factorial(n)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":38249,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:39:36","func_code":"def factorial(n=0):\n return math.factorial(n)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":27106,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:44:35","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":11909,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:44:35","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":9858,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:47:41","func_code":"def minimum(l=[]):\n return min(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":22651,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:47:41","func_code":"def minimum(l=[]):\n return min(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":39615,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:54:26","func_code":"def fibonacci(n):\n if n < 2:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1404,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:54:26","func_code":"def fibonacci(n):\n if n < 2:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22891,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-07 14:57:43","func_code":"def reverse_list(l):\n l2 = []\n if len(l) == 1:\n l2.append(l.pop(-1))\n while len(l) >= 1:\n l2.append(l.pop(-1))\n return l2","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30206,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:57:58","func_code":"def maximum(n=[]):\n return max(maximum(n))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":25334,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:58:12","func_code":"def maximum(n=[]):\n return max(n)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":10771,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 14:58:12","func_code":"def maximum(n=[]):\n return max(n)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":39643,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 15:00:24","func_code":"def count_letters(s=''):\n return count(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":25641,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 15:00:45","func_code":"def count_letters(s=''):\n return len(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":32736,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 15:00:45","func_code":"def count_letters(s=''):\n return len(s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30792,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 15:04:48","func_code":"def reverse_list(l=[]):\n return l.reverse()","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":39479,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 15:08:41","func_code":"def reverse_list(l=[]):\n return l.sort(reverse=True)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":34653,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 15:12:38","func_code":"def reverse_list(l=[]):\n i = 0\n while i < len(l):\n new_list = new_list.append(l[len(l) - i])\n i += 1","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":1592,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 15:13:25","func_code":"def reverse_list(l=[]):\n i = 0\n new_list = []\n while i < len(l):\n new_list.append(l[len(l) - i])\n i += 1\n return new_list","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":31936,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 15:14:06","func_code":"def reverse_list(l=[]):\n i = 0\n new_list = []\n while i < len(l):\n new_list.append(l[len(l) - i - 1])\n i += 1\n return new_list","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":41417,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 15:14:06","func_code":"def reverse_list(l=[]):\n i = 0\n new_list = []\n while i < len(l):\n new_list.append(l[len(l) - i - 1])\n i += 1\n return new_list","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":10522,"user":"82c933c3-be69-41b5-9530-1fe384a7f993","date":"2018-04-07 15:14:06","func_code":"def reverse_list(l=[]):\n i = 0\n new_list = []\n while i < len(l):\n new_list.append(l[len(l) - i - 1])\n i += 1\n return new_list","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":20056,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-07 15:24:45","func_code":"def reverse_list(l):\n l2 = []\n while len(l) >= 1:\n l2.append(l.pop(-1))\n return l2","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":8090,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-07 15:29:35","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":19758,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-07 15:29:35","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":18122,"user":"9f673df6-fcfd-4d07-b0dd-1f553c38f25b","date":"2018-04-07 15:29:35","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":8854,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 21:41:03","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":31020,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 21:41:03","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":32291,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 21:50:24","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":33794,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 21:50:24","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":4113,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 21:54:43","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17360,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 21:54:43","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":25485,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:00:55","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n return minimum(l[1:] if l[0] > l[1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":29038,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:01:40","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":7873,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:01:40","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":23287,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:03:39","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":24401,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:03:39","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":37136,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:10:23","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41134,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:10:23","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":215,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:15:59","func_code":"def reverse_list(l):\n if len[l] == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":20356,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:17:07","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":29561,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:17:07","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":42052,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:21:18","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17600,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:21:18","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28718,"user":"2b5f9b04-bd61-4108-b289-84a2c1002a82","date":"2018-04-07 22:21:18","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1106,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-08 15:07:51","func_code":"def factorial(n):\n if n < 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":34639,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-08 15:07:51","func_code":"def factorial(n):\n if n < 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":7005,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-08 15:09:51","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m ** power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":38529,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-08 15:10:07","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19919,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-08 15:10:07","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":9812,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-08 15:30:17","func_code":"def count_letters(n, word):\n if len(word) == 0:\n return 0\n if word[0] == n:\n count = 1\n else:\n return count + count_letters(n, word[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":3138,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-08 15:30:17","func_code":"def count_letters(n, word):\n if len(word) == 0:\n return 0\n if word[0] == n:\n count = 1\n else:\n return count + count_letters(n, word[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":10538,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-08 15:30:17","func_code":"def count_letters(n, word):\n if len(word) == 0:\n return 0\n if word[0] == n:\n count = 1\n else:\n return count + count_letters(n, word[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":36922,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-08 15:48:57","func_code":"def reverse_list(li):\n newli = []\n if len(li) == 1:\n return li\n x = li.pop()\n newli.append(x)\n s = reverse_list(li)\n for i in s:\n newli.append(i)\n return newli","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":22597,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-08 15:52:00","func_code":"def reverse_list(li):\n newli = []\n if len(li) == 1:\n return li\n x = li.pop()\n newli = reverse_list(li)\n newli.append(x)\n return newli","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":20227,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-08 15:53:05","func_code":"def reverse_list(li):\n newli = []\n if len(li) == 1:\n return li\n x = li.pop(0)\n newli = reverse_list(li)\n newli.append(x)\n return newli","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":2383,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-08 15:54:44","func_code":"def reverse_list(li):\n try:\n newli = []\n if len(li) == 1:\n return li\n x = li.pop(0)\n newli = reverse_list(li)\n newli.append(x)\n return newli\n except:\n return li","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":38301,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-08 15:55:41","func_code":"def reverse_list(li):\n newli = []\n if len(li) == 1 or len(li) == 0:\n return li\n x = li.pop(0)\n newli = reverse_list(li)\n newli.append(x)\n return newli","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":19409,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-08 15:55:41","func_code":"def reverse_list(li):\n newli = []\n if len(li) == 1 or len(li) == 0:\n return li\n x = li.pop(0)\n newli = reverse_list(li)\n newli.append(x)\n return newli","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":29437,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-08 15:55:41","func_code":"def reverse_list(li):\n newli = []\n if len(li) == 1 or len(li) == 0:\n return li\n x = li.pop(0)\n newli = reverse_list(li)\n newli.append(x)\n return newli","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":16657,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:12:21","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":28341,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:12:21","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":8510,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:15:38","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":28859,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:15:38","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":1130,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:16:23","func_code":"def power(n, m):\n if m == 1:\n return n\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":6303,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:16:23","func_code":"def power(n, m):\n if m == 1:\n return n\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":20394,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:17:09","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":20815,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:17:09","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12653,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:17:59","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":24024,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:17:59","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":703,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:19:12","func_code":"def count_letters(s, n=0):\n if len(s) == 0:\n return n\n return count_letters(s[1:], n + 1)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":13555,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:19:12","func_code":"def count_letters(s, n=0):\n if len(s) == 0:\n return n\n return count_letters(s[1:], n + 1)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":17595,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:19:27","func_code":"def reverse_list(li, n=0):\n if n == int(len(li) \/ 2):\n return li\n else:\n li[n], li[-n - 1] = li[-n - 1], li[n]\n return reverse_list(li, n + 1)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":10769,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:19:27","func_code":"def reverse_list(li, n=0):\n if n == int(len(li) \/ 2):\n return li\n else:\n li[n], li[-n - 1] = li[-n - 1], li[n]\n return reverse_list(li, n + 1)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":10939,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:20:08","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32995,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:20:08","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20409,"user":"083d1894-bf7d-4d0e-8d8b-cf9eb95d1546","date":"2018-04-09 03:20:08","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28377,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-09 07:19:10","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = minimum(n[1:])\n return n[0] if n[0] > min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":29993,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-09 07:19:30","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = minimum(n[1:])\n return n[0] if n[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":9024,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-09 07:19:30","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = minimum(n[1:])\n return n[0] if n[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":19848,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-09 07:19:30","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n else:\n min_ret = minimum(n[1:])\n return n[0] if n[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":16747,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-09 12:02:26","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n n -= 1\n x = fibonacci(n) + fibonacci(n - 1)\n return x","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":15437,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-09 12:02:26","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n n -= 1\n x = fibonacci(n) + fibonacci(n - 1)\n return x","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18863,"user":"97b1fa02-4c4e-425b-a371-6b1b38862a02","date":"2018-04-09 12:02:26","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n n -= 1\n x = fibonacci(n) + fibonacci(n - 1)\n return x","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6255,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:01:55","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":42172,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:01:55","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":36254,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:03:38","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":31018,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:04:16","func_code":"def factorial(n):\n if n == 1:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12451,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:04:35","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":5553,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:06:40","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":37803,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:06:40","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14962,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:10:07","func_code":"def power(n, m):\n if m == 0:\n return 0\n elif n == 1:\n return 1\n return n + power(n - 1) ** m","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":3894,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:12:17","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":26460,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:12:17","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":9182,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:16:13","func_code":"def minimum(l):\n mini = 0\n while i < len(l):\n if l[i] < mini:\n mini = l[i]\n i += 1\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":25565,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:16:27","func_code":"def minimum(l):\n mini = 0\n i = 0\n while i < len(l):\n if l[i] < mini:\n mini = l[i]\n i += 1\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":39749,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:17:15","func_code":"def minimum(l):\n mini = 0\n i = 0\n while i < len(l):\n if l[i] < mini:\n mini = l[i]\n i += 1\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":4540,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:18:01","func_code":"def minimum(l):\n mini = 0\n i = 0\n while i < len(l):\n if int(l[i]) < mini:\n mini = int(l[i])\n i = i + 1\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":8157,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:18:21","func_code":"def minimum(l):\n mini = 0\n i = 0\n while i < len(l):\n if int(l[i]) <= mini:\n mini = int(l[i])\n i = i + 1\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":221,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:18:39","func_code":"def minimum(l):\n mini = 0\n i = 0\n while i < len(l):\n if int(l[i]) <= mini:\n mini = int(l[i])\n i = i + 1\n return l[i]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":25078,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:19:05","func_code":"def minimum(l):\n mini = 0\n i = 0\n while i < len(l) - 1:\n if int(l[i]) <= mini:\n mini = int(l[i])\n i = i + 1\n return l[i]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":41708,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:19:26","func_code":"def minimum(l):\n mini = 0\n i = 0\n while i < len(l) - 1:\n if int(l[i]) <= mini:\n mini = int(l[i])\n i = i + 1\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":22886,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:20:05","func_code":"def minimum(l):\n mini = 0\n i = 0\n while i < len(l) - 1:\n if mini > l[i]:\n mini = int(l[i])\n i = i + 1\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":13264,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:20:05","func_code":"def minimum(l):\n mini = 0\n i = 0\n while i < len(l) - 1:\n if mini > l[i]:\n mini = int(l[i])\n i = i + 1\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":28641,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-09 13:20:05","func_code":"def minimum(l):\n mini = 0\n i = 0\n while i < len(l) - 1:\n if mini > l[i]:\n mini = int(l[i])\n i = i + 1\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":41521,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-09 13:26:55","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":10152,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-09 13:26:55","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":38233,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-09 13:28:06","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":29953,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-09 13:28:06","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":9696,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-09 13:33:54","func_code":"def power(n, n2):\n if n == 0:\n return 1\n return n2 * power(n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":6007,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-09 13:34:13","func_code":"def power(n, n2):\n if n == 0:\n return 1\n return n2 * power(n - 1, n2)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":8503,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-09 13:37:43","func_code":"def power(n, n2):\n if n == 0:\n return 0\n if n2 == 0:\n return 1\n return n2 * power(n - 1, n2)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":21311,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-09 13:38:29","func_code":"def power(n, n2):\n if n == 0:\n return 1\n return n2 * power(n - 1, n2)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":30646,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-09 13:39:40","func_code":"def power(n, n2):\n if n == 0:\n return 1\n return n2 * n - 1 + power(n - 1, n2)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":17613,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-09 13:40:00","func_code":"def power(n, n2):\n if n == 0:\n return 1\n return n2 * n + power(n - 1, n2)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":34225,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 15:35:44","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":40043,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 15:35:44","func_code":"def sumup(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":37272,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 15:42:18","func_code":"def factorial(n):\n if n == 1:\n return 1\n elif n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12240,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 15:43:06","func_code":"def factorial(n):\n if n <= 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":32057,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 15:43:06","func_code":"def factorial(n):\n if n <= 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":22863,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 15:49:22","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":10144,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 15:49:22","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":3091,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 15:59:56","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[-1] < l[0]:\n l.pop(0)\n else:\n l.pop()\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":572,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 15:59:56","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[-1] < l[0]:\n l.pop(0)\n else:\n l.pop()\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":30378,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 16:02:15","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[-1] > l[0]:\n l.pop(0)\n else:\n l.pop()\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":6495,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 16:02:15","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[-1] > l[0]:\n l.pop(0)\n else:\n l.pop()\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":35352,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 16:08:12","func_code":"def count_letters(s):\n if s == '':\n return 0\n l = [char for char in s.strip()]\n return 1 + count_letters(''.join(l[:-1]))","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":39178,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 16:08:12","func_code":"def count_letters(s):\n if s == '':\n return 0\n l = [char for char in s.strip()]\n return 1 + count_letters(''.join(l[:-1]))","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":15251,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 16:30:46","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":40987,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 16:31:21","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":11722,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 16:31:21","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":8174,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 16:37:55","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17755,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 16:37:55","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":4752,"user":"bb62ca90-d7ec-42bb-b255-0f55492691ea","date":"2018-04-09 16:37:55","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11913,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-09 17:11:23","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":7093,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-09 17:11:23","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30799,"user":"36685ead-53f8-40af-a908-4c048278dc6b","date":"2018-04-09 17:11:23","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":28152,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-09 17:34:43","func_code":"def factorial(x):\n if x == 1:\n return 1\n if x == 0:\n return 0\n return x * factorial(x - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":15215,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-09 17:35:19","func_code":"def factorial(x):\n if x == 1 or x == 0:\n return 1\n return x * factorial(x - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7604,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-09 17:35:19","func_code":"def factorial(x):\n if x == 1 or x == 0:\n return 1\n return x * factorial(x - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":15109,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-09 17:35:24","func_code":"def sumup(x):\n if x == 0:\n return 0\n return x + sumup(x - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":41372,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-09 17:35:24","func_code":"def sumup(x):\n if x == 0:\n return 0\n return x + sumup(x - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":26807,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-09 17:35:24","func_code":"def sumup(x):\n if x == 0:\n return 0\n return x + sumup(x - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":25038,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-09 21:03:37","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a[-1]) + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":18635,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-09 21:04:23","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return a[-1] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":36652,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-09 21:04:56","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":29326,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-09 21:04:56","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":22424,"user":"213d8254-d887-4b88-8234-2f2edbe536aa","date":"2018-04-09 21:04:56","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":24348,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 22:53:39","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n large = a[0]\n if a[i] > a[0]:\n a.remove(a[0])\n else:\n a.remove(a[1])\n return maximum(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":17763,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 22:54:02","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n large = a[0]\n if a[1] > a[0]:\n a.remove(a[0])\n else:\n a.remove(a[1])\n return maximum(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":23833,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 22:54:02","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n large = a[0]\n if a[1] > a[0]:\n a.remove(a[0])\n else:\n a.remove(a[1])\n return maximum(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":13936,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 22:57:51","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n small = a[0]\n if a[1] < small:\n small = a[i]\n a.remove(a[0])\n else:\n a.remove(a[1])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":3843,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 22:58:14","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n small = a[0]\n if a[1] < small:\n small = a[1]\n a.remove(a[0])\n else:\n a.remove(a[1])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":35798,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 22:58:14","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n small = a[0]\n if a[1] < small:\n small = a[1]\n a.remove(a[0])\n else:\n a.remove(a[1])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":14857,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 22:59:31","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sum(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":134,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 23:00:08","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":38625,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 23:00:08","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":24081,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 23:01:26","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7951,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 23:01:26","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":29885,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 23:02:23","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":3884,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 23:02:23","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19774,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-09 23:02:23","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":6118,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 08:56:57","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":10635,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 08:56:57","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":14613,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 08:59:06","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40479,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:03:52","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20380,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:04:26","func_code":"def factorial(n):\n if n < 1:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":15055,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:04:26","func_code":"def factorial(n):\n if n < 1:\n return 1\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":38556,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:08:50","func_code":"def power(n, i):\n if i == 0:\n return 1\n return n * power(n, i - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":18043,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:08:50","func_code":"def power(n, i):\n if i == 0:\n return 1\n return n * power(n, i - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":28862,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:17:01","func_code":"def minimum(lst):\n if lst == []:\n return 0\n return 1 + minimum(lst[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":6819,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:20:03","func_code":"def minimum(lst):\n if len(lst) == 1:\n return lst[0]\n if lst[0] > lst[-1]:\n return minimum(lst[1:])\n if lst[0] < lst[-1]:\n return minimum(lst[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":8107,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:20:03","func_code":"def minimum(lst):\n if len(lst) == 1:\n return lst[0]\n if lst[0] > lst[-1]:\n return minimum(lst[1:])\n if lst[0] < lst[-1]:\n return minimum(lst[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":19990,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 09:21:43","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":38779,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 09:21:43","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":28370,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:21:50","func_code":"def maximum(lst):\n if len(lst) == 1:\n return lst[0]\n if lst[0] < lst[-1]:\n return maximum(lst[1:])\n if lst[0] > lst[-1]:\n return maximum(lst[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":29528,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:21:50","func_code":"def maximum(lst):\n if len(lst) == 1:\n return lst[0]\n if lst[0] < lst[-1]:\n return maximum(lst[1:])\n if lst[0] > lst[-1]:\n return maximum(lst[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":30084,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 09:23:20","func_code":"def factorial(n):\n if n == 0:\n return 0\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":38612,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 09:23:38","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":37729,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 09:23:38","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":17170,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:25:13","func_code":"def count_letters(string):\n if string == '':\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":37813,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:25:13","func_code":"def count_letters(string):\n if string == '':\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":27528,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 09:26:36","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":12392,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 09:26:36","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":12787,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:32:35","func_code":"def reverse_list(lst):\n if lst == []:\n return []\n return lst[-1] + reverse_list(lst[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":37840,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:33:49","func_code":"def reverse_list(lst):\n if lst == []:\n return []\n return [lst[-1]] + reverse_list(lst[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":41471,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:33:49","func_code":"def reverse_list(lst):\n if lst == []:\n return []\n return [lst[-1]] + reverse_list(lst[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":32190,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:34:57","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n return n * fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8170,"user":"caddc359-e5b0-41d8-94ab-df712d5ea9ce","date":"2018-04-10 09:34:57","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n return n * fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25350,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-10 10:37:49","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":23738,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-10 10:37:49","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":5659,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 10:38:00","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] <= minimum(a[1:]):\n return a[0]\n else:\n return minimum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":7919,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 10:38:00","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] <= minimum(a[1:]):\n return a[0]\n else:\n return minimum(a[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":20798,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-10 10:38:44","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14308,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 10:39:04","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] >= maximum(a[1:]):\n return a[0]\n else:\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":12838,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 10:39:04","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] >= maximum(a[1:]):\n return a[0]\n else:\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":30337,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-10 10:39:04","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] >= maximum(a[1:]):\n return a[0]\n else:\n return maximum(a[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":9128,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-10 10:41:08","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22196,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-10 10:41:08","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12008,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-10 10:43:26","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n ** power(m)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":32577,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-10 10:46:34","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":33152,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-10 10:46:34","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":18877,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-10 10:46:34","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":24458,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:39:07","func_code":"def power(n, n2):\n if n2 == 0:\n return 1\n return n * power(n, n2 - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":35942,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:39:07","func_code":"def power(n, n2):\n if n2 == 0:\n return 1\n return n * power(n, n2 - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":42483,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:49:24","func_code":"def minimum(a):\n if len(a) == 1:\n return n[0]\n elif min <= a[len(a)]:\n min = a[len(a)]\n a.pop()\n else:\n a.pop()\n return minumum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":15327,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:53:36","func_code":"def minimum(a):\n if len(a) == 1:\n return n[0]\n else:\n l = minimum(l[1:])\n if l[0] < l:\n return l[0]\n else:\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":17697,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:54:13","func_code":"def minimum(a):\n if len(a) == 1:\n return n[0]\n else:\n l = minimum(l[1:])\n if a[0] < l:\n return l[0]\n else:\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":35677,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:54:23","func_code":"def minimum(a):\n if len(a) == 1:\n return n[0]\n else:\n l = minimum(l[1:])\n if a[0] < l:\n return l[0]\n else:\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":13662,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:54:36","func_code":"def minimum(a):\n if len(a) == 1:\n return n[0]\n else:\n l = minimum(a[1:])\n if a[0] < l:\n return l[0]\n else:\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":42401,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:54:54","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n l = minimum(a[1:])\n if a[0] < l:\n return l[0]\n else:\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":21398,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:56:01","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n l = minimum(a[1:])\n if a[0] < l:\n return a[0]\n else:\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":34859,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:56:01","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n l = minimum(a[1:])\n if a[0] < l:\n return a[0]\n else:\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":3401,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-10 12:56:22","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":3960,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-10 12:56:22","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14611,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:56:43","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n l = maximum(a[1:])\n if a[0] < l:\n return a[0]\n else:\n return l","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":32623,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:57:20","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n l = maximum(a[1:])\n if a[0] > l:\n return a[0]\n else:\n return l","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":5573,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:57:20","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n l = maximum(a[1:])\n if a[0] > l:\n return a[0]\n else:\n return l","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":13855,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-10 12:57:20","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n l = maximum(a[1:])\n if a[0] > l:\n return a[0]\n else:\n return l","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":36392,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:09:23","func_code":"def sumup(x):\n if x == 0:\n return 0\n return x + sumup(x - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":1834,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:09:23","func_code":"def sumup(x):\n if x == 0:\n return 0\n return x + sumup(x - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":33948,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:10:51","func_code":"def factorial(x):\n if x == 0:\n return 1\n return x * factorial(x - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20831,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:10:51","func_code":"def factorial(x):\n if x == 0:\n return 1\n return x * factorial(x - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":38872,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:12:34","func_code":"def power(n1, n2):\n if n2 == 0:\n return 1\n return n1 * power(n1, n2 - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17951,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:12:34","func_code":"def power(n1, n2):\n if n2 == 0:\n return 1\n return n1 * power(n1, n2 - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":39982,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-10 13:16:33","func_code":"def fibonacci(n):\n if n <= 1:\n return 0\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11486,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-10 13:16:45","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18405,"user":"7c3b55b1-74b7-4570-8484-5a4354d497aa","date":"2018-04-10 13:16:45","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22463,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 13:20:35","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":31487,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 13:20:35","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":33993,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:28:16","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return a[-1] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":29163,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-04-10 13:28:17","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":33713,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-04-10 13:28:31","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":14142,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:29:50","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return reverse_list(a[1:]).append(a[1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":27225,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:30:54","func_code":"def minimum(l):\n if len(l) == 1 or l[0] < minimum(l[1:]):\n return l[0]\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12281,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:30:54","func_code":"def minimum(l):\n if len(l) == 1 or l[0] < minimum(l[1:]):\n return l[0]\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":17716,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:31:28","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return reverse_list(a[1:]).append(a[1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":16997,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:33:52","func_code":"def maximum(l):\n if len(l) == 1 or l[0] > maximum(l[1:]):\n return l[0]\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":6401,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:33:52","func_code":"def maximum(l):\n if len(l) == 1 or l[0] > maximum(l[1:]):\n return l[0]\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":26217,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 13:42:01","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":1092,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 13:42:01","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":26428,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:44:59","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return reverse_list(a[1:]).append(a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":4998,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:45:42","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return reverse_list(a[1:]).append(a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":22564,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 13:46:56","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22020,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:47:04","func_code":"def sumup(N):\n if N != 0:\n N += N - 1\n return N","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":21298,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 13:47:28","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":28275,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 13:47:35","func_code":"def sumup(N):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":33904,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 13:48:01","func_code":"def sumup(N):\n if N == 0:\n return 0\n return N + sumup(N - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":6192,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 13:48:01","func_code":"def sumup(N):\n if N == 0:\n return 0\n return N + sumup(N - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":8872,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:48:43","func_code":"def sumup(N):\n if N == 0:\n return 0\n else:\n return N + sumup(N - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":7196,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:48:43","func_code":"def sumup(N):\n if N == 0:\n return 0\n else:\n return N + sumup(N - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":14347,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:48:57","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return reverse_list(a[1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":15711,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:49:11","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return reverse_list(a[1:])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":3983,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:52:38","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return reverse_list(a[1:]).append(a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":7031,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:52:48","func_code":"def factorial(n):\n if n == 0:\n return 0\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":33532,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:52:51","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41779,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 13:52:51","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":7562,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:53:10","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":19247,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:53:10","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41798,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 13:53:37","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40904,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 13:53:37","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":39991,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:54:08","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return reverse_list(a[1:]) + list(a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":3792,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:54:31","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":27978,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:54:31","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":18148,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:54:44","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":2520,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:54:44","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":13365,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 13:54:51","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":17717,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 13:54:51","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":32458,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 13:55:04","func_code":"def factorial(n):\n if n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":32528,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 13:55:42","func_code":"def factorial(n):\n if n == 1:\n return n\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36909,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 13:56:06","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36294,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 13:56:06","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24555,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:56:41","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n return minimum(a.remove(max(a)))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":7246,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-10 13:56:41","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n return minimum(a.remove(max(a)))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":34316,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:57:26","func_code":"def minimum(l):\n l = sort(l)\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":13162,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 13:57:56","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":12304,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:58:48","func_code":"def minimum(l):\n l = l.sort\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":31463,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:58:54","func_code":"def minimum(l):\n l = l.sort()\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":15924,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 13:59:10","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":2844,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 13:59:10","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":12251,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 13:59:18","func_code":"def minimum(l):\n l = l.sort()\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":1457,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:00:10","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":8341,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:00:25","func_code":"def minimum(l):\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":36542,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:01:13","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":35549,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:01:13","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":21875,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:02:28","func_code":"def minimum(l):\n l = l.sort(key=None)\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":20650,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:02:55","func_code":"def minimum(l):\n l = l.sort(key=min())\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":19684,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:03:03","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":20517,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:04:41","func_code":"def sumup(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":15054,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:04:41","func_code":"def sumup(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":9016,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:04:44","func_code":"def minimum(l):\n sorted(l, key=int)\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":31078,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:05:08","func_code":"def sumup(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":35651,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:05:08","func_code":"def sumup(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":22521,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:05:19","func_code":"def minimum(l):\n sorted(l)\n return l","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":37517,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:05:37","func_code":"def minimum(l):\n return sorted(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":9300,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:05:45","func_code":"def minimum(l):\n return sorted(l)[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41903,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:05:45","func_code":"def minimum(l):\n return sorted(l)[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":594,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:06:11","func_code":"def minimum(l):\n return sorted(l)[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":20220,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:06:11","func_code":"def minimum(l):\n return sorted(l)[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":17225,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:07:21","func_code":"def maximum(l):\n return sorted(l)[len(l) - 1]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":25131,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:07:21","func_code":"def maximum(l):\n return sorted(l)[len(l) - 1]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":22942,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:07:23","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":13017,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:07:23","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22667,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:08:04","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41259,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:08:04","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":39210,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 14:08:27","func_code":"def power(x, y):\n if y == 0:\n return 1\n if y >= 1:\n return x * power(x, y - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":41243,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:08:50","func_code":"def maximum(l):\n return sorted(l)[len() - 1]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":3926,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:09:05","func_code":"def maximum(l):\n return sorted(l)[len(l) - 1]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":23294,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:09:05","func_code":"def maximum(l):\n return sorted(l)[len(l) - 1]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":9366,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 14:09:18","func_code":"def power(m, n):\n if n == 0:\n return 1\n if n >= 1:\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":36783,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:10:19","func_code":"def count_letters(s):\n count = 0\n for c in s:\n count += 1\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":35263,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:10:19","func_code":"def count_letters(s):\n count = 0\n for c in s:\n count += 1\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":10863,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:10:53","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":1343,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:11:22","func_code":"def reverse_list(l):\n return l.sort(reverse=True)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":17768,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:12:14","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":2284,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:12:14","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":17572,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:12:45","func_code":"def power(m, n):\n if n == 0:\n return 1\n else:\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":39927,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:12:45","func_code":"def power(m, n):\n if n == 0:\n return 1\n else:\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":9410,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:13:15","func_code":"def reverse_list(l):\n return reverse_list(l[1:-1]).append(l[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":13575,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 14:13:29","func_code":"def power(m, n):\n if n == 0:\n return 1\n if n >= 1:\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19519,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 14:13:29","func_code":"def power(m, n):\n if n == 0:\n return 1\n if n >= 1:\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":37344,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:14:29","func_code":"def power(m, n):\n if m == 1:\n return 1\n if n == 1:\n return m\n if n == 0:\n return 1\n return m * n + power(m * n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":16958,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:14:34","func_code":"def power(m, n):\n if n == 1:\n return m\n return m * n + power(m * n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":42278,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:14:54","func_code":"def count_letters(s):\n count == 0\n for c in s:\n count += 1\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":5406,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:15:02","func_code":"def power(m, n):\n if n == 1:\n return m\n return m * n + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":30187,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:15:08","func_code":"def count_letters(s):\n count = 0\n for c in s:\n count += 1\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":36877,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:15:08","func_code":"def count_letters(s):\n count = 0\n for c in s:\n count += 1\n return count","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":39800,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:15:34","func_code":"def power(m, n):\n if n == 1:\n return m\n return m ** n + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":688,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:15:53","func_code":"def reverse_list(l):\n return sorted(l, reverse=True)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":7288,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:16:04","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":24600,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:16:04","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":40138,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 14:16:38","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19150,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 14:16:38","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":14987,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:17:15","func_code":"def power(m, n):\n if n == 1:\n return m\n return m ** m + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":40743,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:17:32","func_code":"def power(m, n):\n if m == 1:\n return 1\n if n == 1:\n return m\n if n == 0:\n return 1\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":41028,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:18:27","func_code":"def reverse_list(l):\n return reverse_list(l[1:])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":720,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 14:18:28","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return max(l[0], maximum(l[1:]))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":28135,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 14:18:28","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return max(l[0], maximum(l[1:]))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":7760,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:18:56","func_code":"def power(m, n):\n if m == 1:\n return 1\n if n == 1:\n return m\n if n == 0:\n return 1\n return m ** m + power(n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":8636,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:19:16","func_code":"def power(m, n):\n if m == 1:\n return 1\n if n == 1:\n return m\n if n == 0:\n return 1\n return m ** m + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":17511,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:19:38","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return reverse_list(l[1:])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":17437,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:19:54","func_code":"def reverse_list(l):\n if l == []:\n return []\n else:\n return reverse_list(l[1:])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":10539,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:20:34","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n else:\n return n + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28996,"user":"1ea53a09-863b-4396-bbe3-e75221238368","date":"2018-04-10 14:20:34","func_code":"def fibonacci(n):\n if n == 1:\n return 1\n else:\n return n + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6632,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:20:36","func_code":"def power(m, n):\n if m == 1:\n return 1\n if n == 1:\n return m\n if n == 0:\n return 1\n return m ** m(power(m, n - 1))","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":37002,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:21:01","func_code":"def power(m, n):\n if m == 1:\n return 1\n if n == 1:\n return m\n if n == 0:\n return 1\n return m ** m + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":2932,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:21:29","func_code":"def power(m, n):\n if m == 1:\n return 1\n if n == 1:\n return m\n if n == 0:\n return 1\n return m + m + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":31441,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:21:37","func_code":"def power(m, n):\n while n > 1:\n return m ** m + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":7139,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:22:07","func_code":"def power(m, n):\n if m == 1:\n return 1\n if n == 1:\n return m\n if n == 0:\n return 1\n return m * m + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":34479,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 14:22:20","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n l2 = reverse_list(l[1:])\n l2.append(l[0])\n return l2","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":31462,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 14:22:20","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n l2 = reverse_list(l[1:])\n l2.append(l[0])\n return l2","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":20365,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:23:27","func_code":"def power(m, n):\n if m == 1:\n return 1\n if n == 1:\n return m\n if n == 0:\n return 1\n return m * (m + power(m, n - 1))","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":3794,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:24:23","func_code":"def power(m, n):\n if n == 1:\n return m\n return m * m + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":11643,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-10 14:24:30","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":41442,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-10 14:24:30","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":21677,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:24:42","func_code":"def power(m, n):\n if n == 1:\n return 0\n return m * m + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":12489,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:26:07","func_code":"def power(m, n):\n if m == 1:\n return 1\n if n == 1:\n return m\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":27265,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 14:26:07","func_code":"def power(m, n):\n if m == 1:\n return 1\n if n == 1:\n return m\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":1972,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:26:17","func_code":"def power(m, n):\n if n == 1:\n return 1\n return m ** power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":20648,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:26:45","func_code":"def power(m, n):\n if n == 1:\n return m\n return m ** power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":2734,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-10 14:26:47","func_code":"def count_letters(n='', i=0):\n if n == '':\n return i\n i += 1\n return count_letters(n.replace(n[0], '', 1))","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":7665,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:27:10","func_code":"def power(m, n):\n if n == 1:\n return m\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":26279,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-10 14:27:23","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":10743,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:27:50","func_code":"def power(m, n):\n if n == 1:\n return m\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":8839,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 14:27:50","func_code":"def power(m, n):\n if n == 1:\n return m\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":42351,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-10 14:28:59","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22485,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-10 14:29:12","func_code":"def count_letters(n='', i=0):\n if n == '':\n return i\n i += 1\n return count_letters(n.replace(n[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":33687,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-10 14:29:12","func_code":"def count_letters(n='', i=0):\n if n == '':\n return i\n i += 1\n return count_letters(n.replace(n[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41246,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-10 14:29:51","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":400,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-10 14:29:51","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":31443,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 14:32:31","func_code":"def count_letters(l):\n if l == '':\n return 0\n return 1 + count_letters(l[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":18515,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 14:32:31","func_code":"def count_letters(l):\n if l == '':\n return 0\n return 1 + count_letters(l[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":26289,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-10 14:32:45","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17469,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-10 14:32:45","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":40862,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-10 14:32:45","func_code":"def power(m, n):\n return m ** n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":18495,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:36:49","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return min(l[0], findMinimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":27980,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:37:24","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return min(l[0], minimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":7029,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:37:24","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return min(l[0], minimum(l[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12443,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-10 14:38:37","func_code":"def reverse_list(n):\n if n == []:\n return 0\n return reverse_list(n.reverse())","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":19473,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 14:39:25","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = minimum(t)\n if h > m:\n return m\n else:\n return h","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":9154,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 14:39:25","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = minimum(t)\n if h > m:\n return m\n else:\n return h","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":33683,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-10 14:40:09","func_code":"def reverse_list(n):\n if len(n) == 0:\n return 0\n return reverse_list(n.reverse())","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":28177,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:40:39","func_code":"def fibonacci(n):\n a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, \n 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, \n 196418, 317811]\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22316,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:40:39","func_code":"def fibonacci(n):\n a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, \n 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, \n 196418, 317811]\n return a[n]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":31527,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:41:46","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return max(l[0], maximum(l[1:]))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":18223,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:41:46","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return max(l[0], maximum(l[1:]))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":23016,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-10 14:41:59","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return [n[-1] + reverse_list((1)[:-1])]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":34874,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-10 14:43:31","func_code":"def reverse_list(n):\n if not n:\n return []\n return [n.pop()] + reverse_list(n)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":16817,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-10 14:43:31","func_code":"def reverse_list(n):\n if not n:\n return []\n return [n.pop()] + reverse_list(n)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":40017,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 14:44:45","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33739,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 14:44:45","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23869,"user":"73d23f7d-b20e-4105-a1b6-6760045cdf33","date":"2018-04-10 14:44:45","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22451,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 14:46:05","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = maximum(t)\n if m > h:\n return m\n else:\n return h","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":33525,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 14:46:05","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = maximum(t)\n if m > h:\n return m\n else:\n return h","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":7486,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:47:48","func_code":"def reverse_list(l):\n for i in reversed(l):\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":28160,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 14:48:07","func_code":"def minimum(a):\n try:\n if a[0] < a[1]:\n return minimum(a[:1] + a[2:])\n else:\n return minimum(a[1:])\n except IndexError:\n return a[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":28727,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 14:48:07","func_code":"def minimum(a):\n try:\n if a[0] < a[1]:\n return minimum(a[:1] + a[2:])\n else:\n return minimum(a[1:])\n except IndexError:\n return a[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":35900,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:48:16","func_code":"def reverse_list(l):\n for i in l:\n return reversed(l)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":15194,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:48:27","func_code":"def reverse_list(l):\n return reversed(l)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":16360,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:48:41","func_code":"def reverse_list(l):\n for i in reversed(l):\n return reversed(l)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":10770,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 14:48:50","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":24704,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 14:49:04","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":12502,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 14:49:04","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":34157,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:49:16","func_code":"def reverse_list(l):\n return l[::-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":35174,"user":"3f0a2ff2-f068-43e9-9a21-42850d31b8d3","date":"2018-04-10 14:49:16","func_code":"def reverse_list(l):\n return l[::-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":34743,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 14:50:12","func_code":"def maximum(a):\n try:\n if a[0] > a[1]:\n return maximum(a[:1] + a[2:])\n else:\n return maximum(a[1:])\n except IndexError:\n return a[0]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":36585,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 14:50:12","func_code":"def maximum(a):\n try:\n if a[0] > a[1]:\n return maximum(a[:1] + a[2:])\n else:\n return maximum(a[1:])\n except IndexError:\n return a[0]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":3340,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:56:21","func_code":"def count_letters(s):\n if theString == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":14715,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:56:34","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":31521,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 14:56:34","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":26956,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 14:56:49","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":3388,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 14:58:15","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":25717,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 14:58:15","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":37012,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 14:58:18","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":26050,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 14:59:55","func_code":"def factorial(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":26362,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:00:07","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12548,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:00:07","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24066,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:03:30","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n if l[i] > l[i + 1]:\n i += 1\n l = l[i:]\n else:\n l.pop(i + 1)\n return minimum()","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":34170,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:03:55","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n if l[i] > l[i + 1]:\n i += 1\n l = l[i:]\n else:\n l.pop(i + 1)\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":16545,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:03:55","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n if l[i] > l[i + 1]:\n i += 1\n l = l[i:]\n else:\n l.pop(i + 1)\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41330,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:04:28","func_code":"def minimum(l):\n i = 0\n if len(l) == 1:\n return l[0]\n if l[i] > l[i + 1]:\n i = i + 1\n l = l[i]\n else:\n l.pop(i + 1)\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":23105,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:05:23","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n if l[i] > l[i + 1]:\n i = i + 1\n l = l[i]\n else:\n l.pop(i + 1)\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":34015,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:05:57","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n if l[i] > l[i + 1]:\n i = i + 1\n l = l[i:]\n else:\n l.pop(i + 1)\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":24619,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:05:57","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n if l[i] > l[i + 1]:\n i = i + 1\n l = l[i:]\n else:\n l.pop(i + 1)\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":37461,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:06:27","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n if l[i] < l[i + 1]:\n i += 1\n l = l[i:]\n else:\n l.pop(i + 1)\n return minimum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":22912,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-10 15:06:46","func_code":"def count_letters(s):\n if not s:\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":15159,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-10 15:06:46","func_code":"def count_letters(s):\n if not s:\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":20518,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-10 15:06:46","func_code":"def count_letters(s):\n if not s:\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":16096,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:06:49","func_code":"def power(n, m):\n if m == 0 or n == 0:\n return 1\n return n ** m","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19029,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:06:50","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n if l[i] < l[i + 1]:\n i += 1\n l = l[i:]\n else:\n l.pop(i + 1)\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":5901,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:06:50","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n if l[i] < l[i + 1]:\n i += 1\n l = l[i:]\n else:\n l.pop(i + 1)\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":38551,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:06:58","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n if l[i] < l[i + 1]:\n i = i + 1\n l = l[i:]\n else:\n l.pop(i + 1)\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":30531,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:06:58","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n if l[i] < l[i + 1]:\n i = i + 1\n l = l[i:]\n else:\n l.pop(i + 1)\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":11749,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 15:12:00","func_code":"def count_letters(s, i=0):\n if i < len(s):\n i = i + 1\n return count_letters(s, i)\n else:\n return i","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":27350,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 15:12:00","func_code":"def count_letters(s, i=0):\n if i < len(s):\n i = i + 1\n return count_letters(s, i)\n else:\n return i","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":38704,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:16:35","func_code":"def minimum(n):\n if len(n) == 0:\n return ''\n x = n.sort()\n return x[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":42339,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 15:17:04","func_code":"def reverse_list(l):\n return lambda l: backwards(l[1:]) + l[:1] if l else []","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":11864,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 15:17:51","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18892,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-10 15:17:51","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38313,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:18:20","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n i = 1\n f = s[i + 1:]\n return i + count_letters(f)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":38197,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 15:18:32","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30945,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 15:18:32","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":23545,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:18:57","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n i = 1\n f = s[i + 1:]\n return i + count_letters(f)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":7282,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 15:19:34","func_code":"def reverse_list(l):\n if len(q) != 0:\n temp = q.pop(0)\n reverse(q)\n q.append(temp)\n return q","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":34619,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 15:20:06","func_code":"def reverse_list(l):\n if len(l) != 0:\n temp = q.pop(0)\n reverse(ll)\n l.append(temp)\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":35891,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 15:20:25","func_code":"def reverse_list(l):\n if len(l) != 0:\n temp = l.pop(0)\n reverse(l)\n l.append(temp)\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":4165,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 15:20:50","func_code":"def reverse_list(l):\n if len(l) != 0:\n temp = l.pop(0)\n reverse_list(l)\n l.append(temp)\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":20001,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 15:20:50","func_code":"def reverse_list(l):\n if len(l) != 0:\n temp = l.pop(0)\n reverse_list(l)\n l.append(temp)\n return l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":31799,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:21:47","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n i = 1\n f = s[i:]\n return i + count_letters(f)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":9490,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:21:47","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n i = 1\n f = s[i:]\n return i + count_letters(f)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":33180,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:22:02","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n i = 1\n f = s[i:]\n return i + count_letters(f)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":28654,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:22:02","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n i = 1\n f = s[i:]\n return i + count_letters(f)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":9880,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 15:24:47","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":11739,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 15:24:47","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30896,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:26:58","func_code":"def minimum(n):\n m = sorted(n)\n if n[0] == m[0]:\n return n[0]\n return m[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":17015,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:29:41","func_code":"def maximum(n):\n m = sorted(n)\n if n[0] == m[len(n) - 1]:\n return n[0]\n return m[len(n) - 1]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":214,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:29:41","func_code":"def maximum(n):\n m = sorted(n)\n if n[0] == m[len(n) - 1]:\n return n[0]\n return m[len(n) - 1]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":18365,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 15:31:39","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8184,"user":"c8ff27a3-b9c4-40dd-95d5-68feefbafff7","date":"2018-04-10 15:31:39","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25916,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 15:31:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14171,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 15:31:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33985,"user":"9ae0539b-3842-4209-9c3e-252c74db087e","date":"2018-04-10 15:31:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19236,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:34:33","func_code":"def power(n, m):\n if m == 0 or n == 0:\n return 1\n return n ** power(m)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":25231,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-04-10 15:35:40","func_code":"def fibonacci(l):\n if l == 1 or l == 0:\n return 1\n l -= 1\n return fibonacci(l) + fibonacci(l - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":53,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-04-10 15:35:54","func_code":"def fibonacci(l):\n if l == 1 or l == 0:\n return 1\n l -= 1\n return fibonacci(l) + fibonacci(l - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6733,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-04-10 15:35:54","func_code":"def fibonacci(l):\n if l == 1 or l == 0:\n return 1\n l -= 1\n return fibonacci(l) + fibonacci(l - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":20926,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-04-10 15:36:05","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":11015,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-04-10 15:36:05","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":23270,"user":"dd3b5b53-00cc-42e8-9f77-c46f84f7c7b3","date":"2018-04-10 15:36:05","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":14124,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:41:29","func_code":"def power(n, m):\n if m == 0 or n == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":27453,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:41:29","func_code":"def power(n, m):\n if m == 0 or n == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":12579,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:50:04","func_code":"def minimum(n):\n m = sorted(n)\n if n[0] == m[0]:\n return n[0]\n return minimum(n)[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":8529,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:50:04","func_code":"def minimum(n):\n m = sorted(n)\n if n[0] == m[0]:\n return n[0]\n return minimum(n)[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":5556,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-10 15:50:04","func_code":"def minimum(n):\n m = sorted(n)\n if n[0] == m[0]:\n return n[0]\n return minimum(n)[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":37431,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:51:52","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return a[-1] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":31151,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:52:13","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":2535,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:52:30","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":26299,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 15:52:30","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":32649,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:54:54","func_code":"def reverse_list(l):\n if len(l) == 0:\n return ''\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":34454,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:55:32","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":33634,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:55:32","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":34861,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-10 15:55:32","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":10993,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 15:59:11","func_code":"def reverse_list(a):\n if not a:\n return a\n return str(a[-1]) + reverse_list(str(a[:-1]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":31844,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 15:59:11","func_code":"def reverse_list(a):\n if not a:\n return a\n return str(a[-1]) + reverse_list(str(a[:-1]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":9656,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-10 15:59:11","func_code":"def reverse_list(a):\n if not a:\n return a\n return str(a[-1]) + reverse_list(str(a[:-1]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":11448,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 16:07:27","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22572,"user":"57b690d2-56f4-4fcf-abf7-8719f8802aae","date":"2018-04-10 16:07:27","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13541,"user":"794362b7-cbcd-4bea-bafb-7967c266e248","date":"2018-04-10 16:39:29","func_code":"def reverse_list(i=[]):\n i = 0\n new_list = []\n while i < len(1):\n new_list.append((1)[len(1) - i - 1])\n i = i + 1\n return new_list","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":26700,"user":"794362b7-cbcd-4bea-bafb-7967c266e248","date":"2018-04-10 16:45:19","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":4864,"user":"794362b7-cbcd-4bea-bafb-7967c266e248","date":"2018-04-10 16:45:19","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":4797,"user":"794362b7-cbcd-4bea-bafb-7967c266e248","date":"2018-04-10 16:45:19","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":31894,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-10 16:46:58","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":3299,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-10 16:46:58","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":31083,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-10 16:49:46","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":12426,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-10 16:49:46","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":19957,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-10 16:49:46","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":16221,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 20:36:39","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":6911,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 20:36:39","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":37023,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 20:39:17","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7712,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 20:39:17","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":10870,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 20:46:59","func_code":"def power(m, n):\n if n == 0:\n return 1\n n -= -1\n return m * power(m, n)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":11561,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 20:48:28","func_code":"def power(m, n):\n if n == 0:\n return 1\n n -= 1\n return m * power(m, n)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":35315,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 20:48:28","func_code":"def power(m, n):\n if n == 0:\n return 1\n n -= 1\n return m * power(m, n)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":6490,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 20:51:31","func_code":"def minimum(l):\n if len(l) == 0:\n return None\n return min(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":29455,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:03:52","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n minn = minimum(l[:-1])\n if l[-1] < minn:\n return l[-1]\n else:\n return minn","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":6557,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:03:52","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n minn = minimum(l[:-1])\n if l[-1] < minn:\n return l[-1]\n else:\n return minn","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":6886,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:06:41","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n maxn = maximum(l[:-1])\n print(l[:-1])\n if l[-1] > maxn:\n return l[-1]\n else:\n return maxn","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":38419,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:06:51","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n maxn = maximum(l[:-1])\n if l[-1] > maxn:\n return l[-1]\n else:\n return maxn","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":18603,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:06:51","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n maxn = maximum(l[:-1])\n if l[-1] > maxn:\n return l[-1]\n else:\n return maxn","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":9540,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:15:21","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":23064,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:15:21","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":19551,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:25:05","func_code":"def reverse_list(l):\n if not len(l):\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":39102,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:25:05","func_code":"def reverse_list(l):\n if not len(l):\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":14605,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:34:00","func_code":"def fibonacci(n):\n if any([n == 0, n == 1]):\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36973,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:34:00","func_code":"def fibonacci(n):\n if any([n == 0, n == 1]):\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14519,"user":"35d18426-1565-4cbc-afa0-82ff8cbc8cbd","date":"2018-04-10 21:34:00","func_code":"def fibonacci(n):\n if any([n == 0, n == 1]):\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7301,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-10 22:14:03","func_code":"def sumup(N):\n if N == 0:\n return 0\n return N + sumup(N - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":3670,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-10 22:14:03","func_code":"def sumup(N):\n if N == 0:\n return 0\n return N + sumup(N - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":870,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-10 22:21:45","func_code":"def factorial(N):\n if N == 0:\n return 1\n return N * factorial(N - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":2496,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-10 22:21:45","func_code":"def factorial(N):\n if N == 0:\n return 1\n return N * factorial(N - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7025,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-10 22:36:19","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":22734,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-10 22:36:19","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":16755,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-10 22:36:19","func_code":"def power(n, p):\n if p == 0:\n return 1\n return n * power(n, p - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":39411,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 22:55:51","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":9069,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 22:55:51","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":12765,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 22:58:49","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41428,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 22:59:14","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n + n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":2008,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:03:03","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24724,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:03:03","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":42072,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:09:43","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m + m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":13304,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:10:16","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":5965,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:10:16","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":15337,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:39:17","func_code":"def quicksort(A, p, r):\n if r <= p:\n return\n q = partition(A, p, r)\n quicksort(A, p, q - 1)\n quicksort(A, q + 1, r)\n\n\ndef minimum(l):\n A = l\n p = 0\n r = len(A) - 1\n return quicksort(A, p, r)[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":9820,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:39:36","func_code":"def quicksort(A, p, r):\n if r <= p:\n return\n q = partition(A, p, r)\n quicksort(A, p, q - 1)\n quicksort(A, q + 1, r)\n\n\ndef minimum(l):\n A = l\n p = 0\n r = len(A) - 1\n return quicksort(A, p, r)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":29808,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:39:53","func_code":"def quicksort(A, p, r):\n if r <= p:\n return\n q = partition(A, p, r)\n quicksort(A, p, q - 1)\n quicksort(A, q + 1, r)\n\n\ndef minimum(l):\n A = l\n p = 0\n r = len(A) - 1\n return quicksort(A, p, r)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":33652,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:40:59","func_code":"def quicksort(A, p, r):\n if r <= p:\n return A[0]\n q = partition(A, p, r)\n quicksort(A, p, q - 1)\n quicksort(A, q + 1, r)\n\n\ndef minimum(l):\n A = l\n p = 0\n r = len(A) - 1\n return quicksort(A, p, r)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":35935,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:41:28","func_code":"def quicksort(A, p, r):\n if r <= p:\n return A[0]\n q = partition(A, p, r)\n quicksort(A, p, q - 1)\n quicksort(A, q + 1, r)\n\n\ndef minimum(l):\n A = l\n p = 0\n r = len(A) - 1\n return quicksort(A, p, r)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":31749,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:41:28","func_code":"def quicksort(A, p, r):\n if r <= p:\n return A[0]\n q = partition(A, p, r)\n quicksort(A, p, q - 1)\n quicksort(A, q + 1, r)\n\n\ndef minimum(l):\n A = l\n p = 0\n r = len(A) - 1\n return quicksort(A, p, r)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":10423,"user":"9e8689c2-5967-4244-adc0-65049ce12be4","date":"2018-04-10 23:41:28","func_code":"def quicksort(A, p, r):\n if r <= p:\n return A[0]\n q = partition(A, p, r)\n quicksort(A, p, q - 1)\n quicksort(A, q + 1, r)\n\n\ndef minimum(l):\n A = l\n p = 0\n r = len(A) - 1\n return quicksort(A, p, r)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":31200,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 09:44:57","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41155,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 09:44:57","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":14856,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 09:47:14","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":40158,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 09:47:14","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":40390,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 09:55:48","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":18260,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 09:55:48","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":9489,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 10:15:43","func_code":"def reverse_list(n):\n if len(1) == 0:\n return []\n return (1)[-1] + reverse_list[:1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":5521,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 10:16:53","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return n[-1:] + reverse_list[:-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":40088,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 10:17:41","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return n[-1:] + reverse_list(n[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":3602,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 10:17:41","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return n[-1:] + reverse_list(n[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":36435,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 10:18:26","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29124,"user":"2bb8ff82-061d-43cd-a020-a2cffad09d1e","date":"2018-04-11 10:18:26","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21618,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-11 10:25:27","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":23384,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-11 10:25:27","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":1601,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-11 10:28:45","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1118,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-11 10:28:45","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37648,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-11 10:30:43","func_code":"def reverse_list(a):\n if len(a) == 0:\n b = list()\n return b\n else:\n b = reverse_list(a[1:])\n b.append(a[0])\n return b","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":26634,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-11 10:30:43","func_code":"def reverse_list(a):\n if len(a) == 0:\n b = list()\n return b\n else:\n b = reverse_list(a[1:])\n b.append(a[0])\n return b","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":20388,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-11 10:30:48","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return n[-1:] + reverse_list(n[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":28782,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-11 10:30:48","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return n[-1:] + reverse_list(n[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":17970,"user":"0d8d49aa-e213-4ab4-bcc1-440a0397585c","date":"2018-04-11 10:30:48","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return n[-1:] + reverse_list(n[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":27390,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-11 10:34:22","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33986,"user":"05bc0114-9d34-4210-bb9b-07af403e11ed","date":"2018-04-11 10:34:22","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":24225,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 12:50:20","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":13294,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 12:50:20","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":9248,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 12:50:20","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":18839,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 12:52:26","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":5607,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 12:52:26","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":20577,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 12:52:26","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":24768,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:31","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":22538,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:31","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":24805,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:31","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":39026,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:31","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":13095,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:31","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":30556,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:31","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":14416,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:54","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":28449,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:54","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":10815,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:54","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":8035,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:54","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":16781,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:54","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":34180,"user":"d6b9871a-67ab-4c5d-894e-eb5d53fae3d1","date":"2018-04-11 13:03:54","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":31446,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32761,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19731,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":12578,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":20483,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def minimum(a):\n if len(a) <= 1:\n return a[0]\n return min(a[0], minimum(a[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":10780,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11543,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def minimum(a):\n if len(a) <= 1:\n return a[0]\n return min(a[0], minimum(a[1:]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":8171,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def maximum(a):\n if len(a) <= 1:\n return a[0]\n return max(a[0], maximum(a[1:]))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":33305,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":14078,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def maximum(a):\n if len(a) <= 1:\n return a[0]\n return max(a[0], maximum(a[1:]))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":188,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":27542,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:27","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30551,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:28","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":19908,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:28","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":37346,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:28","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":11639,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:28","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":34527,"user":"9083bfed-4cf9-4111-9300-37bfea094de1","date":"2018-04-11 22:22:28","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":37823,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-12 00:37:32","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":26653,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-12 00:37:32","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":15454,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-12 01:33:34","func_code":"def power(num, ter):\n if ter == 0:\n return 1\n ter = ter - 1\n return num * power(num, ter)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":40596,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-12 01:33:34","func_code":"def power(num, ter):\n if ter == 0:\n return 1\n ter = ter - 1\n return num * power(num, ter)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":41093,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-12 02:19:41","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n smallest = minimum(nums[:-1])\n if nums[-1] < smallest:\n return nums[-1]\n else:\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":13185,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-12 02:19:41","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n smallest = minimum(nums[:-1])\n if nums[-1] < smallest:\n return nums[-1]\n else:\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":21237,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-12 02:19:41","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n smallest = minimum(nums[:-1])\n if nums[-1] < smallest:\n return nums[-1]\n else:\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":20127,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:13:31","func_code":"def power(n, p):\n if p == 0:\n return 1\n else:\n return power(n, p - 1) * n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":10801,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:13:31","func_code":"def power(n, p):\n if p == 0:\n return 1\n else:\n return power(n, p - 1) * n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":31228,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:14:11","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n min_ret = minimum(l[1:])\n return l[0] if l[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":17485,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:14:11","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n min_ret = minimum(l[1:])\n return l[0] if l[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":32249,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:14:45","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n max_ret = maximum(l[1:])\n return l[0] if l[0] > max_ret else max_ret","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":23308,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:14:45","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n max_ret = maximum(l[1:])\n return l[0] if l[0] > max_ret else max_ret","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":3164,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:15:44","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":34395,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:15:44","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":11895,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:16:19","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":39320,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:16:19","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":37586,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:16:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25849,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:16:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5828,"user":"f9b328f7-7323-4ec5-a453-1805a8221b32","date":"2018-04-12 10:16:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17647,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-12 12:13:46","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":38783,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-12 12:13:46","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":23906,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-12 12:17:41","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30867,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-12 12:17:41","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":24533,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-12 12:29:12","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27679,"user":"c4832969-41c4-4f49-a5b9-3475e4308c10","date":"2018-04-12 12:29:12","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11876,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-12 12:58:12","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n f, m = l[0], maximum(l)\n if f > m:\n return f\n else:\n return m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":18908,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-12 12:59:11","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n f, m = l[0], maximum(l[1:])\n if f > m:\n return f\n else:\n return m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":4708,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-12 12:59:11","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n f, m = l[0], maximum(l[1:])\n if f > m:\n return f\n else:\n return m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":10848,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-12 13:02:34","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l\n else:\n return reverse_list(l[1:]) + l[0]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":6609,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-12 13:03:13","func_code":"def reverse_list(l):\n if len(l) < 2:\n return l\n else:\n return reverse_list(l[1:]) + l[0]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":13450,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-12 13:03:40","func_code":"def reverse_list(l):\n if len(l) < 2:\n return l\n else:\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":4693,"user":"54e7d279-e8ef-49c1-8aea-de3ac0b230cf","date":"2018-04-12 13:03:40","func_code":"def reverse_list(l):\n if len(l) < 2:\n return l\n else:\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":41858,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:17:26","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":12309,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:17:26","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":32101,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:23:35","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36207,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:23:35","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7287,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:25:44","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":41449,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:25:44","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":38302,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:31:08","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return minimum(l[1:] if l[0] > l[-1] else l[-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":38974,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-12 14:31:44","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":2466,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-12 14:31:44","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":6641,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:34:00","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":38726,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:34:00","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":11847,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:35:57","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":24749,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:35:57","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":9162,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:37:59","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":5244,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:37:59","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":17149,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:42:03","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":26860,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:42:03","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":11740,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-12 14:42:39","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":25620,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-12 14:42:39","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":4458,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:51:09","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38817,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:51:09","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23366,"user":"f93e7adc-52fc-42e1-ba0d-59e245864c63","date":"2018-04-12 14:51:09","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40604,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-12 15:05:43","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":35895,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-12 15:05:47","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6475,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-12 15:06:03","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":5009,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-12 15:06:07","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5802,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-12 15:06:07","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32349,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-12 15:06:10","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":7431,"user":"536d6075-5a50-4346-89ff-5e21df057756","date":"2018-04-12 15:06:10","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":10735,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-12 15:42:13","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17616,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-12 15:42:13","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":40944,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-12 15:42:13","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":30942,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-12 17:50:18","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n la = a[:1]\n ra = a[1:]\n if maximum(la) < maximum(ra):\n return maximum(ra)\n else:\n return maximum(la)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":226,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-12 17:50:18","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n la = a[:1]\n ra = a[1:]\n if maximum(la) < maximum(ra):\n return maximum(ra)\n else:\n return maximum(la)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":23078,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:01:58","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":35156,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:01:58","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":24745,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:06:44","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12384,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:06:44","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20844,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-12 18:18:27","func_code":"def count_letters(s):\n if len(s) == 1:\n return 1\n elif s == '':\n return 0\n return count_letters(s[:1]) + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":35967,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-12 18:18:27","func_code":"def count_letters(s):\n if len(s) == 1:\n return 1\n elif s == '':\n return 0\n return count_letters(s[:1]) + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41247,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:23:38","func_code":"def power(n, t):\n return n * t","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":22905,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:24:14","func_code":"def power(n, t):\n return n ** t","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":25630,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:34:30","func_code":"def power(n, t):\n if t == 0:\n return 1\n return n * power(n, t - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":3488,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:34:30","func_code":"def power(n, t):\n if t == 0:\n return 1\n return n * power(n, t - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":1538,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:43","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n elif len(l) == 0:\n return 0\n m = maximum(l[1:])\n if m < l[0]:\n return l[0]\n return m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":37068,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:43","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n elif len(l) == 0:\n return 0\n m = maximum(l[1:])\n if m < l[0]:\n return l[0]\n return m","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":8511,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:43","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23592,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:43","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1022,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:44","func_code":"def power(m, n):\n if n == 0:\n return 1\n return power(m, n - 1) * m","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":10987,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:44","func_code":"def sumup(n):\n if n == 0:\n return 0\n return sumup(n - 1) + n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":671,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:44","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n elif len(l) == 0:\n return 0\n m = minimum(l[1:])\n if m > l[0]:\n return l[0]\n return m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41869,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:44","func_code":"def sumup(n):\n if n == 0:\n return 0\n return sumup(n - 1) + n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":6785,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:44","func_code":"def reverse_list(l):\n if len(l) == 1:\n return [l[0]]\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":16316,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:44","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n elif len(l) == 0:\n return 0\n m = minimum(l[1:])\n if m > l[0]:\n return l[0]\n return m","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":25080,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:44","func_code":"def power(m, n):\n if n == 0:\n return 1\n return power(m, n - 1) * m","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17961,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:45","func_code":"def count_letters(s):\n if s == '':\n return 0\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":34519,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:45","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":25506,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:45","func_code":"def count_letters(s):\n if s == '':\n return 0\n return count_letters(s[1:]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":27563,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:37:45","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40582,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:39:10","func_code":"def reverse_list(l):\n if len(l) == 1:\n return [l[0]]\n elif len(l) == 0:\n return []\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":28442,"user":"2ff47805-d62a-4ff9-9297-d30f89b68639","date":"2018-04-12 18:39:10","func_code":"def reverse_list(l):\n if len(l) == 1:\n return [l[0]]\n elif len(l) == 0:\n return []\n return reverse_list(l[1:]) + [l[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":6628,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:42:03","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n minimum_num = minimum(nums[:-1])\n if nums[-1] < minimum_num:\n return nums[-1]\n else:\n return minimum_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41131,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:42:03","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n minimum_num = minimum(nums[:-1])\n if nums[-1] < minimum_num:\n return nums[-1]\n else:\n return minimum_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12057,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:50:24","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n maximum_num = maximum(nums[:-1])\n if nums[-1] > maximum_num:\n return nums[-1]\n else:\n return maximum_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":25018,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:50:24","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n maximum_num = maximum(nums[:-1])\n if nums[-1] > maximum_num:\n return nums[-1]\n else:\n return maximum_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":4036,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-12 18:51:27","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34061,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-12 18:51:27","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38760,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:56:34","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":24273,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 18:56:34","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41999,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 19:08:10","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30655,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 19:08:10","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":6080,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-12 19:10:16","func_code":"def reverse_list(a, i=1, newa=[]):\n if i <= len(a):\n newa.append(a[-i])\n i = i + 1\n return reverse_list(a, i, newa)\n else:\n return newa\n newa = []","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":7112,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-12 19:10:16","func_code":"def reverse_list(a, i=1, newa=[]):\n if i <= len(a):\n newa.append(a[-i])\n i = i + 1\n return reverse_list(a, i, newa)\n else:\n return newa\n newa = []","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":5274,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-12 19:10:16","func_code":"def reverse_list(a, i=1, newa=[]):\n if i <= len(a):\n newa.append(a[-i])\n i = i + 1\n return reverse_list(a, i, newa)\n else:\n return newa\n newa = []","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":13901,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-12 19:21:52","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n e = a[0]\n a = a[1:]\n b = reverse_list(a) + [e]\n return b","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":23590,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-12 19:21:52","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n e = a[0]\n a = a[1:]\n b = reverse_list(a) + [e]\n return b","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":13354,"user":"553c9a10-8e3d-401b-8100-2094287197ed","date":"2018-04-12 19:21:52","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n e = a[0]\n a = a[1:]\n b = reverse_list(a) + [e]\n return b","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":12771,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 20:27:52","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27518,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 20:27:52","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13746,"user":"825987dd-47a8-4023-b124-16b318935de3","date":"2018-04-12 20:27:52","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40947,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-12 21:32:28","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":38355,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-12 21:32:28","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":18764,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-12 21:33:25","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":35524,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-12 21:34:19","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20686,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-12 21:35:12","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":29697,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-12 21:37:19","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":8474,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-12 21:37:55","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":32978,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-12 21:37:55","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":34093,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-12 21:39:51","func_code":"def power(m, n):\n if n == 0:\n return 1\n n -= 1\n return m * power(m, n)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":2802,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-12 21:39:51","func_code":"def power(m, n):\n if n == 0:\n return 1\n n -= 1\n return m * power(m, n)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":42239,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-12 21:39:51","func_code":"def power(m, n):\n if n == 0:\n return 1\n n -= 1\n return m * power(m, n)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":31574,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-13 00:35:42","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n topper = maximum(nums[:-1])\n if nums[-1] > topper:\n return nums[-1]\n else:\n return topper","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":22280,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-13 00:35:42","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n topper = maximum(nums[:-1])\n if nums[-1] > topper:\n return nums[-1]\n else:\n return topper","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":12890,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-13 00:44:47","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":7971,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-13 00:44:47","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":26902,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-13 00:53:38","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n n = list()\n return n\n n = reverse_list(nums[1:])\n n.append(nums[0])\n return n","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":3271,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-13 00:53:38","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n n = list()\n return n\n n = reverse_list(nums[1:])\n n.append(nums[0])\n return n","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":26203,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-13 00:57:27","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22723,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-13 00:57:27","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9455,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-04-13 00:57:27","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":2763,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:18","func_code":"def sumup(n):\n if n == 0:\n return 0\n sum_to_n_minus_1 = sumup(n - 1)\n return n + sum_to_n_minus_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":33081,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:18","func_code":"def sumup(n):\n if n == 0:\n return 0\n sum_to_n_minus_1 = sumup(n - 1)\n return n + sum_to_n_minus_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":41756,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:23","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":9491,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:23","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":21371,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:27","func_code":"def power(m, n):\n if n == 0:\n return 1\n power_n_minus_1 = power(m, n - 1)\n return m * power_n_minus_1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":41133,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:27","func_code":"def power(m, n):\n if n == 0:\n return 1\n power_n_minus_1 = power(m, n - 1)\n return m * power_n_minus_1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":14433,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:33","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":6550,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:33","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":13227,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:38","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] >= maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":4895,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:38","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] >= maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":8091,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:43","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":8018,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:43","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":24144,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:48","func_code":"def factorial(n):\n if n == 0:\n return 1\n facotrial_n_minus_1 = factorial(n - 1)\n return n * facotrial_n_minus_1","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24477,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:48","func_code":"def factorial(n):\n if n == 0:\n return 1\n facotrial_n_minus_1 = factorial(n - 1)\n return n * facotrial_n_minus_1","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":6084,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:52","func_code":"def fibonacci(N):\n if N == 0 or N == 1:\n return 1\n return fibonacci(N - 1) + fibonacci(N - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18017,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:52","func_code":"def fibonacci(N):\n if N == 0 or N == 1:\n return 1\n return fibonacci(N - 1) + fibonacci(N - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5672,"user":"786f6a47-9cfa-4ca3-89f0-86f322f8a452","date":"2018-04-13 10:35:52","func_code":"def fibonacci(N):\n if N == 0 or N == 1:\n return 1\n return fibonacci(N - 1) + fibonacci(N - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41956,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-04-13 10:39:44","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":10795,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-04-13 10:39:44","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":9763,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-04-13 11:01:03","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":26921,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-04-13 11:01:03","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20008,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 11:17:23","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":13735,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 11:20:12","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":33510,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 11:20:12","func_code":"def factorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":11291,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-13 11:48:43","func_code":"def minimum(n, i=0):\n j = i\n while j < len(n) and n[j] > n[-1]:\n j += 1\n if j < len(n):\n tmp = n[i]\n n[i] = n[j]\n n[j] = tmp\n if j > len(n):\n return n[0]\n return minimum(n, i + 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":36212,"user":"f734d662-6b82-46af-93a9-92b490e12476","date":"2018-04-13 11:48:43","func_code":"def minimum(n, i=0):\n j = i\n while j < len(n) and n[j] > n[-1]:\n j += 1\n if j < len(n):\n tmp = n[i]\n n[i] = n[j]\n n[j] = tmp\n if j > len(n):\n return n[0]\n return minimum(n, i + 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":8064,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 11:54:36","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23910,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:08","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":9205,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:08","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":34122,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:18","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7323,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:18","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":2359,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:31","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":362,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:31","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":35222,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:39","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":30097,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:39","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":42178,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:45","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":6171,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:45","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":22820,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:55","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":24284,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:03:55","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":13208,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:04:04","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":38252,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:04:04","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":40626,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:04:10","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13288,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:04:10","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5646,"user":"86f3bfd9-abca-4a94-ac95-d257d354e3e5","date":"2018-04-13 12:04:10","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":4321,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-13 12:52:49","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33258,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-13 12:52:49","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40853,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-04-13 12:52:49","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38554,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:10:28","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":20264,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:10:28","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":12634,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:11:42","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n return maximum(a.remove(min(a)))","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":23993,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:12:22","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":9235,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:12:22","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":39165,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:12:29","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n a.remove(min(a))\n return maximum(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":40266,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:12:29","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n a.remove(min(a))\n return maximum(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":34194,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:12:35","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":11094,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:12:35","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":5335,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:13:05","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n a.remove(max(a))\n return maximum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":19161,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:13:15","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n smallest = minimum(a[1:])\n if a[0] < smallest:\n smallest = a[0]\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":31299,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:13:15","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n smallest = minimum(a[1:])\n if a[0] < smallest:\n smallest = a[0]\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":30836,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:13:24","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n a.remove(max(a))\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12133,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:13:24","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n a.remove(max(a))\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":32529,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:13:47","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n biggest = maximum(a[1:])\n if a[0] > biggest:\n biggest = a[0]\n return biggest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":35370,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:13:47","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n biggest = maximum(a[1:])\n if a[0] > biggest:\n biggest = a[0]\n return biggest","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":2579,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:14:32","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":6564,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:14:32","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":9213,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:15:11","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":5329,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:15:11","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":7815,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:16:04","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30268,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:16:04","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41255,"user":"d50d9b01-3a58-41e1-995b-b40bb031ea43","date":"2018-04-13 13:16:04","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28495,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:17:25","func_code":"def reverse_list(a):\n if len(a) == 1:\n return a\n b = a[1:]\n return reverse_list(b).append(a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":22843,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:21:24","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a).append(a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":9788,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:21:49","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a[1:]).append(a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":4466,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:22:47","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":38241,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:22:47","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":35982,"user":"e425d75d-4acb-48c4-b113-9d72b4603c15","date":"2018-04-13 13:22:47","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return reverse_list(a[1:]) + [a[0]]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":40448,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 13:27:51","func_code":"def power(m, n):\n if n == 1:\n return m\n else:\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":30481,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 13:28:17","func_code":"def power(m, n):\n if n == 1:\n return m\n if n != 1:\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":10560,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 13:31:09","func_code":"def power(m, n):\n if n == 0:\n return 1\n if n != 1:\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":15856,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 13:31:34","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17580,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 13:32:21","func_code":"def power(m, n):\n if n == 0:\n return 1\n print(m * power(m, n - 1))\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":15572,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 13:57:16","func_code":"def power(m, n):\n if n == 0:\n return 1\n print((m, n))\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":24785,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 14:40:14","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":8739,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 14:40:14","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":7378,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:40:49","func_code":"def minimum(l):\n if len(l) == 1:\n return l[1]\n else:\n mnum = minimum(l[1:])\n minn = mnum\n if mnum < minn:\n minn = mnum\n return minn","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":37804,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:41:44","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n mnum = minimum(l[1:])\n minn = mnum\n if mnum < minn:\n minn = mnum\n return minn","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":13115,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:45:02","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n m1 = minimum(l[0:len(l) \/ 2])\n m2 = minimum(l[len(l) \/ 2:])\n if m1 < m2:\n return m1\n else:\n return m2","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":17310,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 14:45:53","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":11287,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 14:45:53","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14035,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:46:08","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n m1 = minimum(l[:len(l) \/\/ 2])\n m2 = minimum(l[len(l) \/\/ 2:])\n if m1 < m2:\n return m1\n else:\n return m2","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":11600,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:46:34","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n m1 = minimum(l[:len(l) \/\/ 2])\n m2 = minimum(l[len(l) \/\/ 2:])\n print((m1, m2))\n if m1 < m2:\n return m1\n else:\n return m2","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":39168,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:47:40","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n m1 = minimum(l[:len(l) \/\/ 2])\n m2 = minimum(l[len(l) \/\/ 2:])\n if m1 < m2:\n return m1\n else:\n return m2","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":5600,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:47:40","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n m1 = minimum(l[:len(l) \/\/ 2])\n m2 = minimum(l[len(l) \/\/ 2:])\n if m1 < m2:\n return m1\n else:\n return m2","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":2095,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:48:41","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n m1 = minimum(l[:len(l) \/\/ 2])\n m2 = minimum(l[len(l) \/\/ 2:])\n if m1 > m2:\n return m1\n else:\n return m2","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":19149,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:49:07","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n m1 = maximum(l[:len(l) \/\/ 2])\n m2 = maximum(l[len(l) \/\/ 2:])\n if m1 > m2:\n return m1\n else:\n return m2","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":2414,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:49:07","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n m1 = maximum(l[:len(l) \/\/ 2])\n m2 = maximum(l[len(l) \/\/ 2:])\n if m1 > m2:\n return m1\n else:\n return m2","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":6445,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 14:49:48","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":16470,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 14:49:48","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":26042,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:53:39","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":37470,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:54:09","func_code":"def count_letters(s):\n if s == '':\n return 0\n print(s)\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":5842,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:54:47","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":34460,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 14:54:47","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":648,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:07:42","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":2109,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:07:42","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":19547,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:09:25","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":1117,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:09:25","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":8685,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:15:05","func_code":"def power(n, t):\n if t == 0:\n return 1\n t -= 1\n return n * power(n, t)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19951,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:15:05","func_code":"def power(n, t):\n if t == 0:\n return 1\n t -= 1\n return n * power(n, t)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":152,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:18:05","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":37337,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:18:05","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":18332,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:21:03","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":6909,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:21:03","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":29359,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-13 15:23:33","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n j = 1\n while i < len(l) - 1 and l[i] < l[j]:\n i += 1\n j += 1\n l.pop(i)\n minimum(l)\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":1172,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-13 15:23:33","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n j = 1\n while i < len(l) - 1 and l[i] < l[j]:\n i += 1\n j += 1\n l.pop(i)\n minimum(l)\n return l[0]","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":661,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:23:58","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":37499,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:23:58","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":33071,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-13 15:26:25","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n j = 1\n while i < len(l) - 1 and l[i] > l[j]:\n i += 1\n j += 1\n l.pop(i)\n maximum(l)\n return l[0]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":511,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-13 15:26:25","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n i = 0\n j = 1\n while i < len(l) - 1 and l[i] > l[j]:\n i += 1\n j += 1\n l.pop(i)\n maximum(l)\n return l[0]","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":1618,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:27:08","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":39889,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:27:08","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":23496,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:30:00","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38457,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:30:00","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37394,"user":"587649dc-83bf-4c24-bb43-de304405f3b9","date":"2018-04-13 15:30:00","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22041,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-13 16:31:46","func_code":"def reverse_list(l):\n if len(l) == 0:\n new_l = list()\n return new_l\n new_l = reverse_list(l[1:])\n new_l.append(l[0])\n return new_l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":32213,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-13 16:31:46","func_code":"def reverse_list(l):\n if len(l) == 0:\n new_l = list()\n return new_l\n new_l = reverse_list(l[1:])\n new_l.append(l[0])\n return new_l","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":29168,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-13 16:36:41","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":8422,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-13 16:36:41","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":28790,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-13 16:36:47","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":11905,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-13 16:36:47","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":12039,"user":"e4dcdad8-3da9-41c5-bbd1-3df3433e270d","date":"2018-04-13 16:36:47","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13203,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:15:09","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sum(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":28328,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:18:52","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":7613,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:18:52","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":18834,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:20:18","func_code":"def factorial(n):\n if n <= 1:\n return n\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":31953,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:20:38","func_code":"def factorial(n):\n if n <= 1:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":42303,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:20:38","func_code":"def factorial(n):\n if n <= 1:\n return 1\n else:\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":true} {"submission_id":29557,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:30:13","func_code":"def power(m, n):\n if n == 0:\n return 1\n else:\n return m * (m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":15157,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:30:43","func_code":"def power(m, n):\n if n == 0:\n return 1\n else:\n return sum(m * (m, n - 1))","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":10348,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:31:32","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":29100,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:31:32","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19963,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:44:01","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":36047,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:44:01","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":25194,"user":"104b03f1-1241-495d-996a-ba8f4a26b8bc","date":"2018-04-13 17:44:01","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":21206,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:01:40","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10288,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:01:40","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29323,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:02:55","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n k = a[-1]\n a.pop()\n return [k] + reverse_list(a)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":20469,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:03:43","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n k = a[-1]\n a.pop()\n return [k] + reverse_list(a)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":42337,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:03:43","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n k = a[-1]\n a.pop()\n return [k] + reverse_list(a)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":2967,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:04:29","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > a[1]:\n a.remove(a[1])\n else:\n a.remove(a[0])\n return maximum(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":39804,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:04:29","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n if a[0] > a[1]:\n a.remove(a[1])\n else:\n a.remove(a[0])\n return maximum(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":24711,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:05:03","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] < a[1]:\n a.remove(a[1])\n else:\n a.remove(a[0])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":33011,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:05:03","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n if a[0] < a[1]:\n a.remove(a[1])\n else:\n a.remove(a[0])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":21096,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:05:47","func_code":"def power(m, n):\n if n == 0 or m == 1:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":35646,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:05:47","func_code":"def power(m, n):\n if n == 0 or m == 1:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":19778,"user":"f15a871d-61c5-494f-8886-91e213b59201","date":"2018-04-13 18:05:47","func_code":"def power(m, n):\n if n == 0 or m == 1:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":42407,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 18:24:49","func_code":"def sumup(number):\n if number == 0:\n return 0\n return sumup(number - 1) + number","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":10906,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 18:24:49","func_code":"def sumup(number):\n if number == 0:\n return 0\n return sumup(number - 1) + number","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":12006,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 18:28:29","func_code":"def factorial(number):\n if number == 0:\n return 1\n return factorial(number - 1) * number","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41562,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 18:28:29","func_code":"def factorial(number):\n if number == 0:\n return 1\n return factorial(number - 1) * number","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":42107,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 18:36:19","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":16480,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 18:36:19","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":20819,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 19:57:48","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":21673,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 19:57:48","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":2464,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:58:51","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":38599,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:58:51","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":427,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:00","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":28501,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:00","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":16791,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 19:59:01","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":19503,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:13","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":13373,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:13","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":25509,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:24","func_code":"def power(n, t):\n if t == 0:\n return 1\n t -= 1\n return n * power(n, t)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":22662,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:24","func_code":"def power(n, t):\n if t == 0:\n return 1\n t -= 1\n return n * power(n, t)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":17921,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:29","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":914,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:29","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":40339,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:37","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":25152,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:37","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":23887,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:42","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":38615,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:42","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":22194,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:48","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":21937,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:48","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":30769,"user":"86c8aca1-8364-41e6-bdad-6537f6be6f8d","date":"2018-04-13 19:59:48","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10166,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:01:48","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":16790,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:01:48","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":35054,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:02:29","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":4262,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:02:29","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32837,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:13:24","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n small = a[0]\n if a[1] < small:\n small = a[1]\n a.remove(a[0])\n else:\n a.remove(a[1])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":31316,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:13:24","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n else:\n small = a[0]\n if a[1] < small:\n small = a[1]\n a.remove(a[0])\n else:\n a.remove(a[1])\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":10880,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:15:03","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n big = a[0]\n if a[1] > big:\n big = a[1]\n a.remove(a[0])\n else:\n a.remove(a[1])\n return maximum(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":31256,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:15:03","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n else:\n big = a[0]\n if a[1] > big:\n big = a[1]\n a.remove(a[0])\n else:\n a.remove(a[1])\n return maximum(a)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":16025,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:20:24","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":18119,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:20:24","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":21543,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:24:48","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":9676,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:25:25","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return [n[-1]] + reverse_list(n[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":41008,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:25:25","func_code":"def reverse_list(n):\n if len(n) == 0:\n return []\n return [n[-1]] + reverse_list(n[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":26338,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:28:43","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":8317,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:28:43","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":32911,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:30:32","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28309,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:30:32","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":12480,"user":"d3c205fe-81b7-4dc7-9f7d-7373475a58af","date":"2018-04-13 20:30:32","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":3612,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:41:40","func_code":"def fibonacci(n):\n if n < 2:\n return n\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":28234,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:43:24","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":42285,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:44:13","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":922,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:44:13","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28842,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:49:23","func_code":"def count_letters(n):\n if n == '':\n return 0\n return 1 + count_letters(n[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":36297,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:49:23","func_code":"def count_letters(n):\n if n == '':\n return 0\n return 1 + count_letters(n[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":36465,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:51:51","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n h = n[0]\n t = n[1:]\n m = maximum(t)\n if m > h:\n return m\n else:\n return h","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":8536,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:51:51","func_code":"def maximum(n):\n if len(n) == 1:\n return n[0]\n h = n[0]\n t = n[1:]\n m = maximum(t)\n if m > h:\n return m\n else:\n return h","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":24438,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:52:47","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n h = n[0]\n t = n[1:]\n m = minimum(t)\n if h > m:\n return m\n else:\n return h","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":28118,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:52:47","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n h = n[0]\n t = n[1:]\n m = minimum(t)\n if h > m:\n return m\n else:\n return h","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":39748,"user":"16011fd4-f5e2-4c2c-b014-86692ff746d5","date":"2018-04-13 20:52:47","func_code":"def minimum(n):\n if len(n) == 1:\n return n[0]\n h = n[0]\n t = n[1:]\n m = minimum(t)\n if h > m:\n return m\n else:\n return h","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":33884,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-04-13 20:55:32","func_code":"def fibonacci(number):\n if number == 0 or number == 1:\n return 1\n return fibonacci(number - 1) + fibonacci(number - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":14161,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-04-13 20:55:32","func_code":"def fibonacci(number):\n if number == 0 or number == 1:\n return 1\n return fibonacci(number - 1) + fibonacci(number - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8932,"user":"91c1f76a-f1ab-4be9-b7ed-6ebaa799aa56","date":"2018-04-13 20:55:32","func_code":"def fibonacci(number):\n if number == 0 or number == 1:\n return 1\n return fibonacci(number - 1) + fibonacci(number - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6008,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 20:57:39","func_code":"def minimum(l, currmin=None):\n pos = l.pop()\n if currmin == None or pos < currmin:\n return minimum(l, pos)\n return minimum(l, currmin)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":37496,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 20:58:11","func_code":"def minimum(l, currmin=None):\n if not l:\n return currmin\n pos = l.pop()\n if currmin == None or pos < currmin:\n return minimum(l, pos)\n return minimum(l, currmin)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":24107,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 20:58:11","func_code":"def minimum(l, currmin=None):\n if not l:\n return currmin\n pos = l.pop()\n if currmin == None or pos < currmin:\n return minimum(l, pos)\n return minimum(l, currmin)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":17663,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-13 21:01:49","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":32050,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-13 21:01:49","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":41640,"user":"71d3efb1-0433-44ad-83f0-224949653177","date":"2018-04-13 21:01:49","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":21304,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:02:09","func_code":"def maximum(l, currmax=None):\n if not l:\n return currmax\n pos = l.pop()\n if currmax == None or pos > currmax:\n return maximum(l, pos)\n return maximum(l, currmax)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":1540,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:02:09","func_code":"def maximum(l, currmax=None):\n if not l:\n return currmax\n pos = l.pop()\n if currmax == None or pos > currmax:\n return maximum(l, pos)\n return maximum(l, currmax)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":3312,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:12:43","func_code":"def count_letters(word):\n if not word:\n return 0\n else:\n return 1 + count_letters(word[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":8785,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:12:43","func_code":"def count_letters(word):\n if not word:\n return 0\n else:\n return 1 + count_letters(word[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":14574,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:16:04","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":15855,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:16:04","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":39078,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:16:13","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":25766,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:16:13","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24445,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:18:52","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":2627,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:18:52","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29143,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:19:04","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = minimum(t)\n if h > m:\n return m\n else:\n return h","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":4182,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:19:04","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = minimum(t)\n if h > m:\n return m\n else:\n return h","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12607,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:19:21","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = maximum(t)\n if m > h:\n return m\n else:\n return h","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":33410,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:19:21","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = maximum(t)\n if m > h:\n return m\n else:\n return h","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":814,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-13 21:20:16","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":6858,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-13 21:20:16","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":28844,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:20:20","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":41597,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:20:20","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":28502,"user":"7352a7ab-bc53-49d3-8ca7-32aa046fe82d","date":"2018-04-13 21:20:20","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":25814,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:20:36","func_code":"def reverse_list(a):\n if not a:\n return a\n else:\n return reverse_list(a[1:] + a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":33737,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:21:10","func_code":"def reverse_list(a):\n if a == '':\n return a\n else:\n return reverse_list(a[1:] + a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":16560,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:23:12","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":12853,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:23:12","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":42236,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:23:46","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23474,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:23:46","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":35007,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:24:32","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27620,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:24:32","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32118,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:25:09","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = maximum(t)\n if m > h:\n return m\n else:\n return h","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":29417,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:25:09","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = maximum(t)\n if m > h:\n return m\n else:\n return h","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":27023,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-13 21:25:40","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":31268,"user":"87fe2a11-c843-4db7-a092-fa2c47cf613f","date":"2018-04-13 21:25:40","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18067,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:26:03","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = minimum(t)\n if h > m:\n return m\n else:\n return h","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":29346,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:26:03","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = minimum(t)\n if h > m:\n return m\n else:\n return h","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":39508,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:26:45","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":23695,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:26:45","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":25125,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:27:16","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":11615,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:27:16","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":34386,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:27:51","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":121,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:27:51","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":13374,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-04-13 21:27:51","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":4570,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:29:17","func_code":"def reverse_list(a):\n return [a[-1]] + reverse_list(a[:-1]) if a else []","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":26608,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:43","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9146,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:43","func_code":"def power(n, t):\n if t == 0:\n return 1\n t -= 1\n return n * power(n, t)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":4768,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:43","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":41982,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:43","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36034,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:43","func_code":"def power(n, t):\n if t == 0:\n return 1\n t -= 1\n return n * power(n, t)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":28967,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:43","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":17738,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:43","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":37088,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:43","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":12116,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:44","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":2552,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:44","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":34566,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:44","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":25339,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:44","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":27309,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:44","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20128,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:44","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":926,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:44","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41204,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:44","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12837,"user":"20997107-3eee-4a62-bc0c-56e29ffe0c3d","date":"2018-04-13 21:29:44","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":10526,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:31:08","func_code":"def reverse_list(a):\n if a:\n return [a[-1]] + reverse_list(a[:-1])\n else:\n return []","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":25198,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:31:08","func_code":"def reverse_list(a):\n if a:\n return [a[-1]] + reverse_list(a[:-1])\n else:\n return []","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":26393,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 21:33:15","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41974,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 21:33:15","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":24833,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:35:45","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":5769,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:37:48","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33331,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:37:48","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23170,"user":"919f743b-c8d6-4955-bb0f-9ca7c9bbe1be","date":"2018-04-13 21:37:48","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33598,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 21:46:17","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":10646,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 21:46:17","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":2089,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 21:53:05","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":13891,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 21:53:05","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30627,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-13 21:53:21","func_code":"def reverse_list(list):\n i = 0\n while i <= len(list) \/\/ 2:\n list[i], list[len(list) - 1 - i] = list[len(list) - 1 - i], list[i]\n i += 1\n return list","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":36325,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-13 21:57:33","func_code":"def reverse_list(list):\n i = 0\n while i < len(list) \/\/ 2:\n list[i], list[len(list) - 1 - i] = list[len(list) - 1 - i], list[i]\n i += 1\n return list","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":14800,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-13 21:59:56","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":36677,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-13 21:59:56","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":30956,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 22:00:54","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":18747,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 22:00:54","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":31895,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 22:04:26","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":838,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 22:04:26","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":22416,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 22:07:59","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":33828,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 22:08:21","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":7734,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 22:08:21","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35557,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 22:10:03","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":6342,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 22:10:03","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":37727,"user":"9dea5530-0f82-4127-b25f-20c784224a03","date":"2018-04-13 22:10:03","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":7548,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 22:10:18","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39207,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 22:10:18","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":41620,"user":"f0e181d7-e245-4188-8b78-18a1eeb6a1bc","date":"2018-04-13 22:10:18","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":24575,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-13 22:16:51","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26218,"user":"9d69cd84-adaa-42a8-9530-416762b34c13","date":"2018-04-13 22:16:51","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":19603,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:20:40","func_code":"def sumup(n):\n n = n(n + 1) \/ 2\n return n","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":16913,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:21:45","func_code":"def sumup(n):\n a = n(n + 1) \/ 2\n return a","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":33612,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:23:06","func_code":"def sumup(n):\n if int(n) == 0:\n return '0'\n else:\n return n(n + 1) \/ 2","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":10683,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:23:24","func_code":"def sumup(n):\n if int(n) == 0:\n return '0'\n else:\n return int(n(n + 1) \/ 2)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":12045,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:23:27","func_code":"def power(n, p):\n if p == 0:\n return 1\n else:\n return power(n, p - 1) * n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":1848,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:23:55","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n min_ret = minimum(l[1:])\n return l[0] if l[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":38013,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:23:55","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n min_ret = minimum(l[1:])\n return l[0] if l[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":29635,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:24:22","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n max_ret = maximum(l[1:])\n return l[0] if l[0] > max_ret else max_ret","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":31715,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:24:22","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n max_ret = maximum(l[1:])\n return l[0] if l[0] > max_ret else max_ret","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":37724,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:24:50","func_code":"def power(n, p):\n if p == 0:\n return 1\n else:\n return power(n, p - 1) * n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":3933,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:24:50","func_code":"def power(n, p):\n if p == 0:\n return 1\n else:\n return power(n, p - 1) * n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32865,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:25:06","func_code":"def sumup(n):\n if int(n) == 0:\n return '0'\n else:\n return sumup(n + 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":31810,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:25:30","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":10309,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:25:30","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":40357,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:25:56","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":5063,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:25:56","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38318,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:25:59","func_code":"def sumup(n):\n if int(n) == 0:\n return '0'\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":4338,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:26:26","func_code":"def sumup(n):\n if int(n) == 0:\n return '0'\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":19212,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:27:44","func_code":"def sumup(n):\n if int(n) == 0:\n return 0\n return n + sumup(n + 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":13902,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:28:11","func_code":"def sumup(n):\n if int(n) == 0:\n return 0\n return int(n) + sumup(int(n) - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":24073,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:30:22","func_code":"def factorial(n):\n if int(n) == 0:\n return 0\n return int(n) * factorial(int(n) - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23047,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:30:44","func_code":"def factorial(n):\n if int(n) == 1:\n return 1\n return int(n) * factorial(int(n) - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":18969,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:31:28","func_code":"def count_letters(s):\n if len(s) == 1:\n return 1\n elif s == '':\n return 0\n return count_letters(s[:1]) + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":23098,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:31:28","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18401,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:31:28","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n le = a[0:1]\n a = a[1:]\n if minimum(le) < minimum(a):\n return minimum(le)\n else:\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12239,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:31:28","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 2) + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":37147,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:31:28","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n e = a[0]\n a = a[1:]\n b = reverse_list(a) + e\n return b","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":12431,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:31:28","func_code":"def count_letters(s):\n if len(s) == 1:\n return 1\n elif s == '':\n return 0\n return count_letters(s[:1]) + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41052,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:31:28","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n le = a[0:1]\n a = a[1:]\n if minimum(le) < minimum(a):\n return minimum(le)\n else:\n return minimum(a)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":7499,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:31:29","func_code":"def power(x, y):\n if y == 0:\n return 1\n return x * power(x, y - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":21713,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:31:29","func_code":"def power(x, y):\n if y == 0:\n return 1\n return x * power(x, y - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":830,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:31:58","func_code":"def factorial(n):\n if int(n) >= 1:\n return 1\n return int(n) * factorial(int(n) - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":19691,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:32:11","func_code":"def factorial(n):\n if int(n) >= 1:\n return 1\n return int(n) * factorial(int(n) + 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41484,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:32:28","func_code":"def factorial(n):\n if int(n) == 1:\n return 1\n return int(n) * factorial(int(n) + 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":35256,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:33:09","func_code":"def factorial(n):\n if int(n) == 1:\n return 1\n return int(n) * factorial(int(n) - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":24287,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:34:10","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n la = a[:1]\n ra = a[1:]\n if maximum(la) < maximum(ra):\n return maximum(ra)\n else:\n return maximum(la)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":16496,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:34:10","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n la = a[:1]\n ra = a[1:]\n if maximum(la) < maximum(ra):\n return maximum(ra)\n else:\n return maximum(la)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":7962,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:34:46","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n e = a[0]\n a = a[1:]\n b = reverse_list(a) + [e]\n return b","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":1548,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:34:46","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n e = a[0]\n a = a[1:]\n b = reverse_list(a) + [e]\n return b","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":2733,"user":"6fb1b046-1d89-4162-8437-722d44e22f50","date":"2018-04-13 22:34:46","func_code":"def reverse_list(a):\n if len(a) == 0:\n return a\n e = a[0]\n a = a[1:]\n b = reverse_list(a) + [e]\n return b","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":42167,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:35:15","func_code":"def factorial(n):\n if int(n) == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41119,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:36:02","func_code":"def sumup(n):\n if int(n) == 0:\n return 0\n return int(n) + sumup(int(n) - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":5158,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:36:02","func_code":"def sumup(n):\n if int(n) == 0:\n return 0\n return int(n) + sumup(int(n) - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":30640,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:36:06","func_code":"def factorial(n):\n if int(n) == 1:\n return 1\n elif int(n) == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":21813,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:36:06","func_code":"def factorial(n):\n if int(n) == 1:\n return 1\n elif int(n) == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":40764,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 22:40:43","func_code":"def sumup(n):\n if n == 0:\n return 0\n sum_to_n_minus_1 = sumup(n - 1)\n return n + sum_to_n_minus_","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":31551,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 22:41:37","func_code":"def sumup(n):\n if n == 0:\n return 0\n sum_to_n_minus_1 = sumup(n - 1)\n return n + sum_to_n_minus_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":29554,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 22:41:37","func_code":"def sumup(n):\n if n == 0:\n return 0\n sum_to_n_minus_1 = sumup(n - 1)\n return n + sum_to_n_minus_1","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":9632,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 22:43:14","func_code":"def factorial(n):\n if n == 0:\n return 1\n facotrial_n_minus_1 = factorial(n - 1)\n return n * facotrial_n_minus_1","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":18999,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 22:43:14","func_code":"def factorial(n):\n if n == 0:\n return 1\n facotrial_n_minus_1 = factorial(n - 1)\n return n * facotrial_n_minus_1","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":29864,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 22:44:29","func_code":"def power(m, n):\n if n == 0:\n return 1\n power_n_minus_1 = power(m, n - 1)\n return m * power_n_minus_1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":478,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-13 22:47:38","func_code":"def count_letters(word):\n if word == '':\n return 0\n return count_letters(word[:-1]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":29216,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-13 22:47:38","func_code":"def count_letters(word):\n if word == '':\n return 0\n return count_letters(word[:-1]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":5171,"user":"a0677365-0929-4e2e-8719-3729105927cd","date":"2018-04-13 22:47:38","func_code":"def count_letters(word):\n if word == '':\n return 0\n return count_letters(word[:-1]) + 1","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":26166,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:53:35","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":11910,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:53:35","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":11019,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:53:35","func_code":"def power(n, p):\n if p == 0:\n return 1\n else:\n return power(n, p - 1) * n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":15197,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 22:53:35","func_code":"def power(n, p):\n if p == 0:\n return 1\n else:\n return power(n, p - 1) * n","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":26861,"user":"e4629340-a577-4a87-bbfb-8adf98c283ef","date":"2018-04-13 22:53:35","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":12764,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 22:54:52","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n mini = minimun(a[:-1])\n if a[-1] < mini:\n return a[-1]\n else:\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":38334,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 22:55:11","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n mini = minimum(a[:-1])\n if a[-1] < mini:\n return a[-1]\n else:\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":2849,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 22:55:11","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n mini = minimum(a[:-1])\n if a[-1] < mini:\n return a[-1]\n else:\n return mini","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12957,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-13 22:55:18","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":21467,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-13 22:55:18","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":25091,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-13 22:55:39","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":30784,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-13 22:55:39","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":29077,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-13 22:55:57","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":14855,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-13 22:55:57","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":28385,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-13 22:56:17","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36866,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-13 22:56:17","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33455,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-13 22:56:44","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":23089,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-13 22:56:44","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":34277,"user":"f278f0d6-3389-497b-a30b-f0d8ecebb7e1","date":"2018-04-13 22:56:44","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":41891,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-13 22:58:05","func_code":"def minimum(lst):\n return min(lst)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":37926,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-13 22:58:05","func_code":"def minimum(lst):\n return min(lst)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":31787,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-13 23:00:35","func_code":"def maximum(lst):\n return max(lst)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":2906,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-13 23:00:35","func_code":"def maximum(lst):\n return max(lst)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":23120,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 23:01:17","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n maxi = maximum(a[:-1])\n if a[-1] > maxi:\n return a[-1]\n else:\n return maxi","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":12397,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 23:01:17","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n maxi = maximum(a[:-1])\n if a[-1] > maxi:\n return a[-1]\n else:\n return maxi","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":4201,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:03:12","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n min_ret = minimum(l[1:])\n return l[0] if l[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":13960,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:03:12","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n min_ret = minimum(l[1:])\n return l[0] if l[0] < min_ret else min_ret","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":42384,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:04:40","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n maxi = minimum(l[1:])\n return l[0] if l[0] > maxi else maxi","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":false} {"submission_id":23289,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:04:54","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n maxi = maximum(l[1:])\n return l[0] if l[0] > maxi else maxi","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":9464,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:04:54","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n maxi = maximum(l[1:])\n return l[0] if l[0] > maxi else maxi","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":39310,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 23:05:09","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":3566,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 23:05:09","func_code":"def count_letters(s):\n if s == '':\n return 0\n else:\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":8345,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-13 23:05:11","func_code":"def count_letters(str):\n total = 0\n for letters in str:\n total += 1\n return total","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":38731,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-13 23:05:11","func_code":"def count_letters(str):\n total = 0\n for letters in str:\n total += 1\n return total","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":28455,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:06:04","func_code":"def power(m, n):\n if n == 0:\n return 1\n power_n_minus_1 = power(m, n - 1)\n return m * power_n_minus_1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":27223,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:06:04","func_code":"def power(m, n):\n if n == 0:\n return 1\n power_n_minus_1 = power(m, n - 1)\n return m * power_n_minus_1","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":18076,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:07:06","func_code":"def count_letters(l):\n if len(l) == 0:\n return 0\n else:\n return 1 + count_letters(l + 1)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":13394,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:07:36","func_code":"def count_letters(l):\n if len(l) == 0:\n return 0\n else:\n return 1 + count_letters(l[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":16869,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:07:36","func_code":"def count_letters(l):\n if len(l) == 0:\n return 0\n else:\n return 1 + count_letters(l[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30308,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 23:08:08","func_code":"def reverse_list(l):\n if len(a) == 0:\n return []\n else:\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":20568,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 23:08:27","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n else:\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":6954,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 23:08:27","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n else:\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":12174,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:08:42","func_code":"def reverse_list(l):\n if len(l) == 0:\n return 0\n else:\n return l[-1] + count_letters(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":40495,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:08:55","func_code":"def reverse_list(l):\n if len(l) == 0:\n return 0\n else:\n return l[-1] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":8941,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-13 23:09:38","func_code":"def reverse_list(lst):\n return lst[::-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":33135,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-13 23:09:38","func_code":"def reverse_list(lst):\n return lst[::-1]","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":40567,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:09:40","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":3751,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:09:40","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n else:\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":11988,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 23:10:33","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":18414,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 23:11:16","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13359,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 23:11:16","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":4210,"user":"70a531fa-76d5-4949-ae20-9c7e6db61af8","date":"2018-04-13 23:11:16","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39796,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:16:16","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":937,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:16:16","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6236,"user":"0412928d-97c6-46f2-980b-7d98214b9765","date":"2018-04-13 23:16:16","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33260,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-13 23:19:56","func_code":"def fibonacci(int):\n if int == 0 or int == 1:\n return 1\n return fibonacci(int - 1) + fibonacci(int - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":27235,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-13 23:19:56","func_code":"def fibonacci(int):\n if int == 0 or int == 1:\n return 1\n return fibonacci(int - 1) + fibonacci(int - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":26345,"user":"142cacda-ba1b-469c-9b25-8603a78324c9","date":"2018-04-13 23:19:56","func_code":"def fibonacci(int):\n if int == 0 or int == 1:\n return 1\n return fibonacci(int - 1) + fibonacci(int - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":8331,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:22:44","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":20466,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:22:44","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] <= minimum(l[1:]):\n return l[0]\n else:\n return minimum(l[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":14164,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:23:57","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] >= maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":10766,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:23:57","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] >= maximum(l[1:]):\n return l[0]\n else:\n return maximum(l[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":5942,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-13 23:24:32","func_code":"def reverse_list(a):\n if not a:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":6918,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-13 23:24:32","func_code":"def reverse_list(a):\n if not a:\n return a\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":13222,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-13 23:27:17","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":27093,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-13 23:27:17","func_code":"def count_letters(s):\n if len(s) == 0:\n return 0\n return 1 + count_letters(s[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":36589,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-13 23:29:07","func_code":"def reverse_list(l):\n if len(l) == 0:\n rl = list()\n return rl\n rl = reverse_list(l[1:])\n rl.append(l[0])\n return rl","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":16225,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-13 23:29:07","func_code":"def reverse_list(l):\n if len(l) == 0:\n rl = list()\n return rl\n rl = reverse_list(l[1:])\n rl.append(l[0])\n return rl","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":19656,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-13 23:29:39","func_code":"def fibonacci(n):\n i = 1\n l = [0, 1]\n while i < n + 1:\n l.append(l[i] + l[i - 1])\n i += 1\n return l[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":35537,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-13 23:29:39","func_code":"def fibonacci(n):\n i = 1\n l = [0, 1]\n while i < n + 1:\n l.append(l[i] + l[i - 1])\n i += 1\n return l[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":16384,"user":"30a4c165-17bc-4bdf-a096-e2a252a403eb","date":"2018-04-13 23:29:39","func_code":"def fibonacci(n):\n i = 1\n l = [0, 1]\n while i < n + 1:\n l.append(l[i] + l[i - 1])\n i += 1\n return l[-1]","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25098,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:31:05","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":26865,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:31:05","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":2274,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:32:28","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":22926,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:32:28","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":19903,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:34:12","func_code":"def fibonacci(N):\n if N == 0 or N == 1:\n return 1\n return fibonacci(N - 1) + fibonacci(N - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":23773,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:34:12","func_code":"def fibonacci(N):\n if N == 0 or N == 1:\n return 1\n return fibonacci(N - 1) + fibonacci(N - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17786,"user":"d05025fd-0a14-4010-acb6-dea38896a651","date":"2018-04-13 23:34:12","func_code":"def fibonacci(N):\n if N == 0 or N == 1:\n return 1\n return fibonacci(N - 1) + fibonacci(N - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":39741,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-13 23:37:03","func_code":"def fibonacci(n):\n if n < 2:\n return 1\n return fib(n - 1) + fib(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":24603,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-13 23:37:47","func_code":"def fibonacci(n):\n if n < 2:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29388,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-13 23:37:47","func_code":"def fibonacci(n):\n if n < 2:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36376,"user":"831aaa20-0b62-4198-b323-52fc0aa8363b","date":"2018-04-13 23:37:47","func_code":"def fibonacci(n):\n if n < 2:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":1073,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:38:35","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":9353,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:38:35","func_code":"def reverse_list(a):\n if len(a) == 0:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":12990,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:39:07","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":34842,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:39:07","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":27145,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:39:38","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":36340,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:39:38","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":992,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:40:06","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = minimum(t)\n if h > m:\n return m\n else:\n return h","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":1422,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:40:06","func_code":"def minimum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = minimum(t)\n if h > m:\n return m\n else:\n return h","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":32607,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:41:51","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = maximum(t)\n if m > h:\n return m\n else:\n return h","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":18875,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:41:51","func_code":"def maximum(a):\n if len(a) == 1:\n return a[0]\n h = a[0]\n t = a[1:]\n m = maximum(t)\n if m > h:\n return m\n else:\n return h","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":22373,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 23:41:59","func_code":"def minimum(list):\n smallest = list[0]\n for nr in list:\n if nr < smallest:\n smallest = nr\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":4729,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 23:41:59","func_code":"def minimum(list):\n smallest = list[0]\n for nr in list:\n if nr < smallest:\n smallest = nr\n return smallest","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":6079,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:02","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":3380,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:02","func_code":"def sumup(n):\n if n == 0:\n return 0\n else:\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":26200,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:12","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7996,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:12","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36170,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:19","func_code":"def power(m, n):\n if n < 1:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":41132,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:19","func_code":"def power(m, n):\n if n < 1:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":23054,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:42:20","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6031,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:42:20","func_code":"def fibonacci(n):\n if n <= 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36395,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:31","func_code":"def minimum(li):\n if len(li) == 1:\n return li[0]\n if li[0] < li[-1]:\n li[-1] = li[0]\n return minimum(li[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":21296,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:31","func_code":"def minimum(li):\n if len(li) == 1:\n return li[0]\n if li[0] < li[-1]:\n li[-1] = li[0]\n return minimum(li[1:])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":12288,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:39","func_code":"def maximum(li):\n if len(li) == 1:\n return li[0]\n if li[0] > li[-1]:\n li[-1] = li[0]\n return maximum(li[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":33922,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:39","func_code":"def maximum(li):\n if len(li) == 1:\n return li[0]\n if li[0] > li[-1]:\n li[-1] = li[0]\n return maximum(li[1:])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":825,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:46","func_code":"def count_letters(s, n=0):\n if len(s) == 0:\n return n\n return count_letters(s[1:], n + 1)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":4852,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:46","func_code":"def count_letters(s, n=0):\n if len(s) == 0:\n return n\n return count_letters(s[1:], n + 1)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":1636,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:42:52","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":36770,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:42:52","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":33457,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:58","func_code":"def reverse_list(li, n=0):\n if n == int(len(li) \/ 2):\n return li\n else:\n li[n], li[-n - 1] = li[-n - 1], li[n]\n return reverse_list(li, n + 1)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":27118,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:42:58","func_code":"def reverse_list(li, n=0):\n if n == int(len(li) \/ 2):\n return li\n else:\n li[n], li[-n - 1] = li[-n - 1], li[n]\n return reverse_list(li, n + 1)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":3445,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:43:00","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":16340,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:43:00","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":12261,"user":"f21b9b8a-bb0a-4eef-ad07-667fd7acbc1b","date":"2018-04-13 23:43:00","func_code":"def count_letters(s):\n if s == '':\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":26496,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:43:06","func_code":"def fibonacci(n, older=0, old=1):\n if n == 0:\n return old\n return fibonacci(n - 1, old, older + old)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38596,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:43:06","func_code":"def fibonacci(n, older=0, old=1):\n if n == 0:\n return old\n return fibonacci(n - 1, old, older + old)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10481,"user":"1d4a4b3b-be4e-49dc-96cc-fceb60ad22a1","date":"2018-04-13 23:43:06","func_code":"def fibonacci(n, older=0, old=1):\n if n == 0:\n return old\n return fibonacci(n - 1, old, older + old)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":34163,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 23:44:47","func_code":"def maximum(list):\n maximum = list[0]\n for nr in list:\n if nr > maximum:\n maximum = nr\n return maximum","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":21481,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 23:44:47","func_code":"def maximum(list):\n maximum = list[0]\n for nr in list:\n if nr > maximum:\n maximum = nr\n return maximum","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":36127,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 23:48:23","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":32042,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 23:48:23","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":12924,"user":"0964a543-93db-460b-a0c5-d0c94fea250f","date":"2018-04-13 23:48:23","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return [l[-1]] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":38582,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-13 23:52:24","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":25133,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-13 23:52:24","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9082,"user":"61106f0d-7c7b-4b7a-a3d3-5ba1af9aacf4","date":"2018-04-13 23:52:24","func_code":"def fibonacci(n):\n if n == 1 or n == 0:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":10426,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:55:08","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":40800,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:55:08","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":36713,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:55:45","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":38799,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:55:45","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":20256,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:56:13","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":12960,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:56:13","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":1393,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:56:43","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":4959,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:56:43","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n else:\n return minimum(l[1:] if l[0] > l[-1] else l[:-1])","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":36363,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:57:20","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":40860,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:57:20","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n else:\n return maximum(l[1:] if l[0] < l[-1] else l[:-1])","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":41037,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:58:05","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":28433,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:58:05","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return l[-1:] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":37198,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:58:29","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6421,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:58:29","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n if n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36958,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:59:01","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":32155,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:59:01","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":24797,"user":"3e0829d0-8e72-4878-8d83-441773f88f67","date":"2018-04-13 23:59:01","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":4578,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:20:55","func_code":"def append2list(l1, l2=None):\n if l2 != None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":37293,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:21:49","func_code":"def append2list(l1, l2=None):\n if l2 != None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":39776,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:22:26","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2\n else:\n return l1","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":38106,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:22:43","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":37849,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:23:31","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l2:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":false} {"submission_id":38136,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:24:37","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":28552,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:24:37","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":30593,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:28:59","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n r = (r0 - r1) ** 2\n centre = (x1 - x2) ** 2 + (y1 - y2) ** 2\n return r <= centre <= r","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":22631,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:29:14","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n r = (r1 - r2) ** 2\n centre = (x1 - x2) ** 2 + (y1 - y2) ** 2\n return r <= centre <= r","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":14982,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:30:44","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n r = r1 + r2\n centre = math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\n return centre >= r","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":29553,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:31:18","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n r = r1 + r2\n centre = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return centre >= r","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":17759,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:32:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n r = r1 + r2\n centre = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return centre < r","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":24165,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-14 11:32:15","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n r = r1 + r2\n centre = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n return centre < r","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41382,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-14 11:59:37","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30180,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-14 11:59:37","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":20658,"user":"d0e5b214-932e-4ec6-ae62-66baacab8b6c","date":"2018-04-14 11:59:37","func_code":"def count_letters(s):\n if not s:\n return 0\n return 1 + count_letters(s[1:])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":6296,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-14 16:41:44","func_code":"def reverse_list(list):\n if list == []:\n return []\n elif len(list) == 1:\n newlist = []\n newlist.append(list.pop())\n else:\n return reverse_list(list[1:])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":34866,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-14 17:59:20","func_code":"def reverse_list(list):\n if list == []:\n return []\n else:\n return list(reverse_list(list[1:])).append(list[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":38254,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-14 19:35:52","func_code":"def reverse_list(list):\n if list == []:\n return []\n elif len(list) == 1:\n return [].append(list)\n else:\n return reverse_list(list[1:]).append(list[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":40610,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-14 19:36:55","func_code":"def reverse_list(list):\n if list == []:\n return []\n elif len(list) == 1:\n return [].append(list)\n else:\n return reverse_list(list[1:]).append(list[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":7621,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-14 19:43:33","func_code":"def reverse_list(a):\n if a == []:\n return []\n else:\n return a","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":13602,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-14 19:47:14","func_code":"def reverse_list(a):\n if a == []:\n return []\n elif len(a) == 1:\n return a\n else:\n b = [reverse_list(a[1:])]\n return b.append(a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":11504,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-14 19:48:31","func_code":"def reverse_list(a):\n if a == []:\n return []\n else:\n b = [reverse_list(a[1:])]\n return b.append(a[0])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":12223,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-14 20:03:00","func_code":"def reverse_list(a):\n if a == []:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":40422,"user":"27057d38-c1f9-4b8d-a26e-f287a0546d33","date":"2018-04-14 20:03:00","func_code":"def reverse_list(a):\n if a == []:\n return []\n return [a[-1]] + reverse_list(a[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":8114,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:11:35","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":41717,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:11:35","func_code":"def count_letters(string):\n if len(string) == 0:\n return 0\n return 1 + count_letters(string[:-1])","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":20324,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:11:40","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":27637,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:11:40","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":14410,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:11:44","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17645,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:11:44","func_code":"def fibonacci(num):\n if num == 0 or num == 1:\n return 1\n return fibonacci(num - 1) + fibonacci(num - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29121,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:11:52","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":27073,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:11:52","func_code":"def maximum(nums):\n if len(nums) == 1:\n return nums[0]\n max_num = maximum(nums[:-1])\n if nums[-1] > max_num:\n return nums[-1]\n else:\n return max_num","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":37708,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:11:57","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":1333,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:11:57","func_code":"def minimum(nums):\n if len(nums) == 1:\n return nums[0]\n min_num = minimum(nums[:-1])\n if nums[-1] < min_num:\n return nums[-1]\n else:\n return min_num","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":14585,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:12:02","func_code":"def power(n, t):\n if t == 0:\n return 1\n t -= 1\n return n * power(n, t)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":38258,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:12:02","func_code":"def power(n, t):\n if t == 0:\n return 1\n t -= 1\n return n * power(n, t)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":34288,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:12:07","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":20709,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:12:07","func_code":"def reverse_list(nums):\n if len(nums) == 0:\n new_nums = list()\n return new_nums\n new_nums = reverse_list(nums[1:])\n new_nums.append(nums[0])\n return new_nums","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":16742,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:12:12","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":5035,"user":"2106aae8-699f-4446-9f0f-2bbf8032501a","date":"2018-04-15 22:12:12","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":16369,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:33:26","func_code":"def count_letters(s='', i=0):\n print((s, i))\n if s == '':\n return i\n i += 1\n return count_letters(s.replace(s[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":36020,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:34:37","func_code":"def count_letters(s='', i=0):\n print((s, i))\n if s == '':\n return i\n i += 1\n return count_letters(s.replace(s[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":30276,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:35:35","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":7791,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:35:35","func_code":"def factorial(n):\n if n == 0:\n return 1\n if n == 1:\n return n\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":8015,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:35:42","func_code":"def fibonacci(i, n=1):\n if i == 1 or i == 0:\n return 1\n return fibonacci(i - 1) + fibonacci(i - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":33383,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:35:42","func_code":"def fibonacci(i, n=1):\n if i == 1 or i == 0:\n return 1\n return fibonacci(i - 1) + fibonacci(i - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":38502,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:35:50","func_code":"def maximum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[-1]\n return maximum(l, i + 1)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":4950,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:35:50","func_code":"def maximum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[-1]\n return maximum(l, i + 1)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":17405,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:35:57","func_code":"def minimum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[0]\n return minimum(l, i + 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":8988,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:35:57","func_code":"def minimum(l, i=0):\n j = i\n while j < len(l) and l[j] > l[-1]:\n j += 1\n if j < len(l):\n tmp = l[i]\n l[i] = l[j]\n l[j] = tmp\n if j > len(l):\n return l[0]\n return minimum(l, i + 1)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":21028,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:36:05","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":21703,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:36:05","func_code":"def power(n, m):\n if m == 0:\n return 1\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":41899,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:36:12","func_code":"def reverse_list(l, i=0):\n if i == len(l) \/\/ 2:\n return l\n tmp = l[i]\n l[i] = l[len(l) - 1 - i]\n l[len(l) - 1 - i] = tmp\n i += 1\n return reverse_list(l, i)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":20209,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:36:12","func_code":"def reverse_list(l, i=0):\n if i == len(l) \/\/ 2:\n return l\n tmp = l[i]\n l[i] = l[len(l) - 1 - i]\n l[len(l) - 1 - i] = tmp\n i += 1\n return reverse_list(l, i)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":10329,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:36:20","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":6978,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 22:36:20","func_code":"def sumup(n):\n if n == 0:\n return n\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":29745,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 23:27:28","func_code":"def count_letters(s='', i=0):\n if s == '':\n return i\n i += 1\n return count_letters(s.replace(s[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":29236,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 23:27:28","func_code":"def count_letters(s='', i=0):\n if s == '':\n return i\n i += 1\n return count_letters(s.replace(s[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":6069,"user":"e9910cff-d2a2-4310-a748-9ad97a5a964c","date":"2018-04-15 23:27:28","func_code":"def count_letters(s='', i=0):\n if s == '':\n return i\n i += 1\n return count_letters(s.replace(s[0], '', 1), i)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":4839,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:31:39","func_code":"def sumup(n):\n total = [int(i) for i in range(0, n)]\n return sum(total)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":34223,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:31:51","func_code":"def sumup(n):\n total = [int(i) for i in range(0, n + 1)]\n return sum(total)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":5816,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:31:51","func_code":"def sumup(n):\n total = [int(i) for i in range(0, n + 1)]\n return sum(total)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":14634,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:35:16","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n total = 1\n for i in range(0, n):\n total *= i\n return factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":37189,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:35:33","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n total = 1\n for i in range(0, n):\n total *= i\n return factorial(n - 1) * n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":20915,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:35:33","func_code":"def factorial(n):\n if n == 0:\n return 1\n else:\n total = 1\n for i in range(0, n):\n total *= i\n return factorial(n - 1) * n","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23923,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:38:40","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":13324,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:38:40","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":15677,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:43:34","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n large = l[0]\n for num in l:\n if num > large:\n large = num\n return l.remove(large)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":38724,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:43:52","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n large = l[0]\n for num in l:\n if num > large:\n large = num\n return minumum(l.remove(large))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":19534,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:44:04","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n large = l[0]\n for num in l:\n if num > large:\n large = num\n return minimum(l.remove(large))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":31057,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:44:41","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n large = l[0]\n for num in l:\n if num > large:\n large = num\n l.remove(large)\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":39963,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:44:41","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n large = l[0]\n for num in l:\n if num > large:\n large = num\n l.remove(large)\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":26657,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:46:12","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n small = l[0]\n for n in l:\n if n < small:\n small = n\n l.remove(small)\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":4651,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:46:12","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n small = l[0]\n for n in l:\n if n < small:\n small = n\n l.remove(small)\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":5186,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:54:46","func_code":"def reverse_list(l, new_list=None):\n if new_list == None:\n new_list = []\n if len(l) > 0:\n new_list.append(a.pop())\n return reverse_list(l, new_list)\n else:\n return new_list","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":35645,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:55:04","func_code":"def reverse_list(l, new_list=None):\n if new_list == None:\n new_list = []\n if len(l) > 0:\n new_list.append(l.pop())\n return reverse_list(l, new_list)\n else:\n return new_list","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":24587,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-16 11:55:04","func_code":"def reverse_list(l, new_list=None):\n if new_list == None:\n new_list = []\n if len(l) > 0:\n new_list.append(l.pop())\n return reverse_list(l, new_list)\n else:\n return new_list","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":26228,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 16:40:47","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":19120,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 16:40:47","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":10462,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 16:42:42","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23225,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 16:43:08","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":39593,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 16:43:08","func_code":"def factorial(n):\n if n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":27862,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 16:46:03","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * (m * power(m, n - 1))","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":16452,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 16:48:00","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":13726,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 16:48:00","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":31680,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 17:01:23","func_code":"def fibonacci(n):\n if n == 0:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":22904,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 17:02:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13499,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 17:02:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32775,"user":"0f25ed97-3bfd-4793-bb56-26c57236aeda","date":"2018-04-16 17:02:46","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":29614,"user":"2af7aa4a-b11e-4a9b-907a-db5b9c315694","date":"2018-04-17 11:29:23","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":29325,"user":"2af7aa4a-b11e-4a9b-907a-db5b9c315694","date":"2018-04-17 11:29:23","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":26625,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-22 11:34:41","func_code":"def swap_unique_keys_values(d):\n return {a[1]: a[0] for a in list(d.items()) if list(d.values()).count(a\n [1]) == 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":35954,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-22 11:34:41","func_code":"def swap_unique_keys_values(d):\n return {a[1]: a[0] for a in list(d.items()) if list(d.values()).count(a\n [1]) == 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":13152,"user":"50aef720-52de-4735-8874-78f5a311b939","date":"2018-04-22 11:34:41","func_code":"def swap_unique_keys_values(d):\n return {a[1]: a[0] for a in list(d.items()) if list(d.values()).count(a\n [1]) == 1}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":23085,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 16:16:49","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":13529,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 16:16:49","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":8217,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 16:16:49","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":19206,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 16:16:49","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n if n == 1:\n return 1\n else:\n fibN_2 = 0\n fibN_1 = 1\n i = 2\n while i <= n:\n fibN = fibN_2 + fibN_1\n fibN_2 = fibN_1\n fibN_1 = fibN\n i = i + 1\n return fibN","func_name":"fibonacci","assignment_id":"fibonacci_iter","academic_year":2017,"module":"ca278","test":"assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309","description":"Iteratively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":20021,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 16:16:49","func_code":"def index(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return i\n i = i + 1\n return -1","func_name":"index","assignment_id":"index_iter","academic_year":2017,"module":"ca278","test":"assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0","description":"Iteratively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":28414,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 16:16:49","func_code":"def search(str, letter):\n i = 0\n while i < len(str):\n if letter == str[i]:\n return True\n i = i + 1\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":4886,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 16:18:30","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":14949,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 16:18:30","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":27182,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 16:24:51","func_code":"def index(str, letter, pos):\n import fibonacci\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23776,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 16:24:51","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":41020,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:06:04","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":26676,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:06:04","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":3125,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:06:04","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(str, letter):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23977,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:08:47","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":16750,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:08:47","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(str, letter):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":8527,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:08:47","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":35436,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:09:29","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":10822,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:09:29","func_code":"def search(ls, val):\n if ls == []:\n return\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(str, letter):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":28467,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:09:29","func_code":"def search(ls, val):\n if ls == []:\n return\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":34728,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:09:50","func_code":"def search(ls, val):\n if ls == []:\n return\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(str, letter):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":7638,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:09:50","func_code":"def search(ls, val):\n if ls == []:\n return\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":37953,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:09:50","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":22762,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:20","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(str, letter):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":15099,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:20","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":39266,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:20","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":34675,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:32","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":23123,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:32","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":40207,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:32","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(str, letter):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":23975,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:32","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":7190,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:32","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(str, letter):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":11059,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:32","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":12925,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:32","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":22639,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:32","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":34054,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-26 17:26:32","func_code":"def search(ls, val):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(str, letter):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":24365,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-27 12:57:27","func_code":"def swap_keys_values(d):\n new_d = {}\n for keys in d:\n new_d[d[keys]] = keys\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":40761,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-27 12:57:27","func_code":"def swap_keys_values(d):\n new_d = {}\n for keys in d:\n new_d[d[keys]] = keys\n return new_d","func_name":"swap_keys_values","assignment_id":"swap_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'}","description":"Swap the keys of a dictionary with its values.","correct":true} {"submission_id":18306,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-27 13:00:15","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n seen = set()\n for key in d:\n seen += d[key]\n for key in d:\n if d[key] in seen:\n new_d[d[key]] = key\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":31992,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-27 13:01:00","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n seen = []\n for key in d:\n seen.append(d[key])\n for key in d:\n if d[key] in set(seen):\n new_d[d[key]] = key\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":5435,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-27 13:02:04","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n seen = []\n for key in d:\n seen.append(d[key])\n for key in d:\n if seen.count(d[key]) == 1:\n new_d[d[key]] = key\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":40410,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-27 13:02:04","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n seen = []\n for key in d:\n seen.append(d[key])\n for key in d:\n if seen.count(d[key]) == 1:\n new_d[d[key]] = key\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":4674,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-04-27 13:02:04","func_code":"def swap_unique_keys_values(d):\n new_d = {}\n seen = []\n for key in d:\n seen.append(d[key])\n for key in d:\n if seen.count(d[key]) == 1:\n new_d[d[key]] = key\n return new_d","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":true} {"submission_id":41506,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:25:38","func_code":"def search(ls, letter):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)\n\n\ndef index(ls, letter):\n if ls == []:\n return -1\n elif ls[0] == val:\n return val\n else:\n return search(ls[1:], val)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":false} {"submission_id":17001,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:25:38","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":10160,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:25:38","func_code":"def search(ls, letter):\n if ls == []:\n return False\n elif ls[0] == val:\n return True\n else:\n return search(ls[1:], val)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":11415,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:32:19","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":8966,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:32:19","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":14875,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:32:19","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == val:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":17313,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:32:48","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":31580,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:32:48","func_code":"def search(str, letter):\n if str == []:\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":false} {"submission_id":9673,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:32:48","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":27866,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:34:04","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":25885,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:34:04","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":16032,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:34:04","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":15459,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:34:04","func_code":"def fibonacci(n):\n if n == 0:\n return 0\n elif n == 1:\n return 1\n else:\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca278","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":true} {"submission_id":42026,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:34:04","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":2741,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:34:04","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":19824,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:34:04","func_code":"def index(str, letter, pos):\n if pos == len(str):\n return -1\n elif str[pos] == letter:\n return pos\n else:\n return index(str, letter, pos + 1)","func_name":"index","assignment_id":"index_recur","academic_year":2017,"module":"ca278","test":"assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2","description":"Recursively search for the position of letter in str, return -1 if it is not there.","correct":true} {"submission_id":10501,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:34:04","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":9527,"user":"2d5a247c-29b2-4cc2-a956-669a2206edc8","date":"2018-04-30 13:34:04","func_code":"def search(str, letter):\n if str == '':\n return False\n elif str[0] == letter:\n return True\n else:\n return search(str[1:], letter)","func_name":"search","assignment_id":"search_recur","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Recursively search for a letter in a string","correct":true} {"submission_id":16321,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-04-30 14:06:16","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":30094,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-04-30 14:06:16","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":34410,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-04-30 14:06:16","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":38544,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-04-30 14:06:16","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":1283,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-04-30 14:06:16","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":13701,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-04-30 14:06:16","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":22818,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-04-30 14:06:16","func_code":"def remove_zeros(list):\n while 0 in list:\n list.remove(0)","func_name":"remove_zeros","assignment_id":"remove_zeros","academic_year":2017,"module":"ca278","test":"assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None","description":"Take a list of numbers and removes the zeros from it.","correct":true} {"submission_id":25769,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-04-30 14:06:16","func_code":"def weird_case(some_str):\n new_str = ''\n i = 0\n lc = 0\n while i < len(some_str):\n if some_str[i].isalpha():\n if lc % 2 == 0:\n new_str += some_str[i].upper()\n else:\n new_str += some_str[i].lower()\n lc += 1\n else:\n new_str += some_str[i]\n i = i + 1\n return new_str","func_name":"weird_case","assignment_id":"weird_case","academic_year":2017,"module":"ca278","test":"assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj","description":"Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower.","correct":false} {"submission_id":21674,"user":"e5f35cd7-8337-4a68-bda3-4164a982feae","date":"2018-04-30 14:06:16","func_code":"def merge_lists(l1, l2):\n l3 = []\n i = 0\n while i < len(l1):\n l3.append(l1[i])\n i += 2\n i = 0\n while i < len(l2):\n l3.append(l2[i])\n i += 2\n return l3","func_name":"merge_lists","assignment_id":"merge_lists","academic_year":2017,"module":"ca278","test":"assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765]","description":"Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2.","correct":true} {"submission_id":41844,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-30 23:02:45","func_code":"def swap_unique_keys_values(d):\n b = {}\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":40018,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-30 23:02:45","func_code":"def swap_unique_keys_values(d):\n b = {}\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":28754,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-04-30 23:02:45","func_code":"def swap_unique_keys_values(d):\n b = {}\n return {v: k for k, v in list(d.items())}","func_name":"swap_unique_keys_values","assignment_id":"swap_unique_keys_values","academic_year":2017,"module":"ca117","test":"assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'}","description":"Swap the keys of a dictionary with its unique values.","correct":false} {"submission_id":30516,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-04 12:23:35","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":40516,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-04 12:23:35","func_code":"def append2list(l1, l2=None):\n if l2 == None:\n l2 = []\n for i in l1:\n l2.append(i)\n return l2","func_name":"append2list","assignment_id":"append2list","academic_year":2017,"module":"ca117","test":"assert append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866],[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866])==[-16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866, -16276, 117, -12248, -4743, -25, -6030600119498841921, -8866, -12248, -4743, -25, -6030600119498841921, -8866] and append2list([-21267],[-21267, -21267])==[-21267, -21267, -21267]","description":"Appends elements of a list l1 at the end of the list l2. If l2 not supplied default to empty list.","correct":true} {"submission_id":3822,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-04 12:27:50","func_code":"def overlap(x1, y1, r1, x2, y2, r2):\n distance = (x1 - x2) ** 2 + (y0 - y1) ** 2\n radii = r1 + r2\n return distance > radii","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26598,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-04 12:28:16","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = (x1 - x2) ** 2 + (y0 - y1) ** 2\n radii = r1 + r2\n return distance > radii","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":3529,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-04 12:28:32","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = (x1 - x2) ** 2 + (y1 - y2) ** 2\n radii = r1 + r2\n return distance > radii","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":17905,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-04 12:28:50","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = (x1 - x2) ** 2 + (y1 - y2) ** 2\n radii = r1 + r2\n return distance >= radii","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":19492,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-04 12:29:16","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = (x1 - x2) ** 2 + (y1 - y2) ** 2\n radii = r1 + r2\n return radii <= distance >= radii","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":41479,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-04 12:30:11","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = (x1 - x2) ** 2 + (y1 - y2) ** 2\n radii = (r1 + r2) ** 2\n radii1 = (r1 - r2) ** 2\n return radii1 <= distance >= radii","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":4704,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-04 12:31:40","func_code":"def overlap(x1=0, y1=0, r1=0, x2=0, y2=0, r2=0):\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n radii = r1 + r2\n return distance >= radii","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":26230,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-04 12:32:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n radii = r1 + r2\n return distance < radii","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":678,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-04 12:32:38","func_code":"def overlap(x1=0, y1=0, r1=1, x2=0, y2=0, r2=1):\n distance = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n radii = r1 + r2\n return distance < radii","func_name":"overlap","assignment_id":"overlap","academic_year":2017,"module":"ca117","test":"assert overlap(12,-6058,21436,-3483096651887624530,24,31017)==False and overlap(-30592,-26624,-11905,1,2,30134)==False and overlap(0,0,0,0,0,0)==False and overlap(5128,-8635,-28938,25,-31295,-21637807133189218411179185993653430151)==False and overlap(-16348,-2218,2871,-15155,-83,24475)==True and overlap(4807,1216206119,8753907074291481720,-19844,-26061,-15639)==True and overlap(1348593950,19232,-10923,20,2259187900768772679,-5343103208648864320)==False and overlap(8410739119977124611,9995,83,8410739119977124611,19348,21604)==True","description":"Test if two circles overlap.","correct":false} {"submission_id":37529,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 14:42:13","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":41604,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 14:42:13","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":14249,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 14:43:58","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return n * factorial(n - 1) + factorial(n - 2)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":18498,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 14:44:32","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return factorial(n - 1) + factorial(n - 2)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":30946,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 14:45:24","func_code":"def factorial(n):\n if n == 0 or n == 1:\n return 1\n return factorial(n - 1) * factorial(n - 2)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":3414,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 14:45:44","func_code":"def factorial(n):\n if n == 0:\n return 1\n return factorial(n - 1) * factorial(n - 2)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":27854,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 14:46:12","func_code":"def factorial(n):\n if n == 1:\n return 1\n return factorial(n - 1) * factorial(n - 2)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":3439,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 14:47:05","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":18005,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 14:49:08","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":22627,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 14:49:22","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":34716,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 14:49:22","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":31427,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:04:00","func_code":"def power(m, n):\n if n == 1:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":9247,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:04:16","func_code":"def power(m, n):\n if n == 1 or n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":1951,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:04:58","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":22615,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:04:58","func_code":"def power(m, n):\n if n == 0:\n return 1\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":28643,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:09:31","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < l[1]:\n l.remove(l[0])\n elif l[0] < l[1]:\n l.remove(l[1])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":40023,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:10:57","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < l[1]:\n l.remove(l[0])\n elif l[1] < l[0]:\n l.remove(l[0])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":42207,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:11:30","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < l[1]:\n l.remove(l[1])\n elif l[1] < l[0]:\n l.remove(l[0])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":28158,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:11:30","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n if l[0] < l[1]:\n l.remove(l[1])\n elif l[1] < l[0]:\n l.remove(l[0])\n return minimum(l)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":41189,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:13:27","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":15908,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:13:27","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n if l[0] > l[1]:\n l.remove(l[1])\n else:\n l.remove(l[0])\n return maximum(l)","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":28740,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:17:14","func_code":"def count_letters(s, l=[]):\n if not s:\n return sum(l)\n l.append(1)\n s = s[1:]\n return count_letters(l, s)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":38565,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:17:49","func_code":"def count_letters(s, l=[]):\n if not s:\n return sum(l)\n l.append(1)\n s = s[1:]\n return count_letters(s, l)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":false} {"submission_id":21812,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:19:16","func_code":"def count_letters(s, l=None):\n if l == None:\n l = []\n if not s:\n return sum(l)\n l.append(1)\n s = s[1:]\n return count_letters(s, l)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":10675,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:19:16","func_code":"def count_letters(s, l=None):\n if l == None:\n l = []\n if not s:\n return sum(l)\n l.append(1)\n s = s[1:]\n return count_letters(s, l)","func_name":"count_letters","assignment_id":"count_letters","academic_year":2017,"module":"ca117","test":"assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13","description":"Return the number of lettres in a string.","correct":true} {"submission_id":4244,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:27:16","func_code":"def reverse_list(l, new_l=None):\n if new_l == None:\n new_l = []\n if len(l) == 0:\n return new_l\n new_l.append(l.pop())\n return reverse_list(l, new_l)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":1395,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:27:16","func_code":"def reverse_list(l, new_l=None):\n if new_l == None:\n new_l = []\n if len(l) == 0:\n return new_l\n new_l.append(l.pop())\n return reverse_list(l, new_l)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":true} {"submission_id":3005,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:29:16","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return n * fibonacci(n - 1) + fibonnaci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":17494,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:29:33","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return n * fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":9232,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:29:51","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return n + fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":40292,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:30:03","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return n + fibonacci(n - 1)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":6815,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:30:34","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return n * (fibonacci(n - 1) + fibonacci(n - 2))","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":13131,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:30:54","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return n + (fibonacci(n - 1) + fibonacci(n - 2))","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":24296,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:31:33","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":28293,"user":"4a1f2726-b713-40f0-b544-9de55d617a12","date":"2018-05-13 15:31:33","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":36722,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-05-14 18:25:00","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":15788,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-05-14 18:25:12","func_code":"def sumup(n):\n if n == 1:\n return 1\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":31840,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-05-14 18:25:45","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":22586,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-05-14 18:25:45","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":39970,"user":"a758f933-ec7a-444d-b3d2-f685ac9d9563","date":"2018-05-14 18:25:45","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":24719,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-05-14 19:44:27","func_code":"def search(str, letter):\n if letter in str:\n print(True)\n else:\n print(False)","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":false} {"submission_id":6327,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-05-14 19:44:52","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":26231,"user":"3bb099c4-4248-4efd-bfe2-3c423b916ce0","date":"2018-05-14 19:44:52","func_code":"def search(str, letter):\n if letter in str:\n return True\n else:\n return False","func_name":"search","assignment_id":"search_iter","academic_year":2017,"module":"ca278","test":"assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True","description":"Iteratively search for a letter in a string","correct":true} {"submission_id":12641,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-26 14:21:10","func_code":"def double(n):\n y = 2 * n\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":8430,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-26 14:21:10","func_code":"def double(n):\n y = 2 * n\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":17840,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-26 14:21:19","func_code":"def circumference(r):\n y = pi * 2 * r\n return y","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":41389,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-26 14:21:19","func_code":"def circumference(r):\n y = pi * 2 * r\n return y","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":2947,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-26 14:21:19","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":22803,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-26 14:21:19","func_code":"def area(r):\n y = pi * r ** 2\n return y","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":35976,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-26 14:21:23","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":7849,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-26 14:21:23","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":40570,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-26 14:21:23","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":42144,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-29 17:52:02","func_code":"def double(n):\n y = 2 * n\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":8984,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-29 17:52:02","func_code":"def double(n):\n y = 2 * n\n return y","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":14716,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-29 17:52:12","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":16636,"user":"8487432c-a440-40f5-afcb-ad0e762b9edb","date":"2018-06-29 17:52:12","func_code":"def swap(a, i, j):\n tmp = a[j]\n a[j] = a[i]\n a[i] = tmp\n return a\n\n\ndef reverse(a):\n i = 0\n while i < len(a) \/ 2:\n j = len(a) - i - 1\n swap(a, i, j)\n i = i + 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":16653,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-07-14 03:06:07","func_code":"def power(n, m):\n if m == 0:\n return 1\n else:\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":36884,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-07-14 03:06:07","func_code":"def power(n, m):\n if m == 0:\n return 1\n else:\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":35194,"user":"c007cbe7-350c-4111-aa1b-fca93c97d7f3","date":"2018-07-14 03:06:07","func_code":"def power(n, m):\n if m == 0:\n return 1\n else:\n return n * power(n, m - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":27342,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:24:10","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":10162,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:24:10","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":34616,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:31:00","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":19819,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:31:00","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return results","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":32151,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:31:00","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":10362,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:31:00","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3272,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:31:00","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":28959,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:32:16","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return results","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":19766,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:32:16","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":19807,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:32:16","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":24684,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:32:16","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":28977,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:32:16","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":10353,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:33:02","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return results","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":2666,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:33:02","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":41879,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:33:02","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":41450,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:33:02","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":32148,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:11","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20509,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:11","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return results","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":15512,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:11","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return sq","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":18961,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:11","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":30767,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:11","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":25634,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:50","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":16213,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:50","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":16304,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:50","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":3210,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:50","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":37183,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:50","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":8947,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:50","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":3988,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:50","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":4138,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:50","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":25015,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:50","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":41500,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-07-31 16:34:50","func_code":"def circle_circumference(n):\n result = 2 * 3.14 * n\n return result","func_name":"circle_circumference","assignment_id":"circle_circumference","academic_year":2017,"module":"ca277","test":"assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32","description":"Return the circumference of a circle.","correct":true} {"submission_id":26564,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:04:35","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + (n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":9335,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:06:16","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + (n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":23069,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:07:06","func_code":"def sumup(n):\n if n == 0:\n return 0\n return sumup(n + (n - 1))","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":false} {"submission_id":34836,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:07:38","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":24083,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:07:38","func_code":"def sumup(n):\n if n == 0:\n return 0\n return n + sumup(n - 1)","func_name":"sumup","assignment_id":"sumup","academic_year":2017,"module":"ca117","test":"assert sumup(0)==0 and sumup(1)==1 and sumup(2)==3 and sumup(10)==55 and sumup(27)==378","description":"Return the sum of all integers up to n.","correct":true} {"submission_id":1566,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:08:51","func_code":"def factorial(n):\n if n == 0:\n return 0\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":1148,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:09:47","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":13674,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:10:31","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":16676,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:12:04","func_code":"def factorial(n):\n if n == 1:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":15323,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:13:29","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":41757,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:13:29","func_code":"def factorial(n):\n if n == 1 or n == 0:\n return 1\n return n * factorial(n - 1)","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":23142,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:23:45","func_code":"def power(m, n):\n if n == 1 or n == 0:\n return m\n return m + m ** power(n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":13670,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:24:28","func_code":"def power(m, n):\n if n == 1 or n == 0:\n return m\n return m ** power(n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":28614,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:24:59","func_code":"def power(m, n):\n if n == 1 or n == 0:\n return m\n elif m == 1:\n return m\n elif m == 0:\n return 0\n return m ** power(n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":35082,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:25:19","func_code":"def power(m, n):\n if n == 1 or n == 0:\n return m\n elif m == 1:\n return m\n elif m == 0:\n return 0\n return m ** power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":37609,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:25:51","func_code":"def power(m, n):\n if n == 1 or n == 0:\n return m\n elif m == 1:\n return m\n elif m == 0:\n return 0\n return m + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":5757,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:26:37","func_code":"def power(m, n):\n if n == 1 or n == 0:\n return m\n elif m == 1:\n return m\n elif m == 0:\n return 0\n return power(m, n) + power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":11817,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:26:57","func_code":"def power(m, n):\n if n == 1 or n == 0:\n return m\n elif m == 1:\n return m\n elif m == 0:\n return 0\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":false} {"submission_id":94,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:28:27","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif n == 1:\n return m\n elif m == 1:\n return m\n elif m == 0:\n return 0\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":5631,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:29:27","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 1:\n return m\n elif m == 0:\n return 0\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":35414,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:29:39","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 1:\n return m\n elif m == 0:\n return 0\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":37442,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:29:39","func_code":"def power(m, n):\n if n == 0:\n return 1\n elif m == 1:\n return m\n elif m == 0:\n return 0\n return m * power(m, n - 1)","func_name":"power","assignment_id":"power","academic_year":2017,"module":"ca117","test":"assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1","description":"Raise m to the power of n.","correct":true} {"submission_id":129,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:31:21","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":12584,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:31:21","func_code":"def fibonacci(n):\n if n == 0 or n == 1:\n return 1\n return fibonacci(n - 1) + fibonacci(n - 2)","func_name":"fibonacci","assignment_id":"fibonacci_recur","academic_year":2017,"module":"ca117","test":"assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657","description":"Recursively compute the value of the fibonacci series at position n.","correct":false} {"submission_id":32514,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:39:57","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return l[-1] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":28556,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:40:19","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return l[-1] + reverse_list(l[1:])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":22634,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:41:26","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return l[-1].append(reverse_list(l[1:]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":30495,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:43:35","func_code":"def reverse_list(l):\n if len(l) == 0:\n return []\n return reverse_list(l[-1]).append(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":33908,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:46:12","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return reverse_list(l[-1]).append(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":14956,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:46:38","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return l\n return reverse_list(l[-1]).append(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":40218,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:47:36","func_code":"def reverse_list(l):\n return reverse_list(l[-1]).append(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":10456,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:56:44","func_code":"def minimum(l, min):\n if not l:\n return []\n return minimum(l[1:], l[0] if l[0] < val else val)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":36420,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:57:29","func_code":"def minimum(l, min):\n if not l:\n return []\n return minimum(l[1:], l[0] if l[0] < min else min)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":9509,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 17:58:29","func_code":"def minimum(l):\n min = None\n if not l:\n return []\n return minimum(l[-1] if l[-1] < min else min)","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":4297,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 18:02:51","func_code":"def minimum(l):\n if not l:\n return []\n return minimum(min(l[:-1]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":5204,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 18:03:33","func_code":"def minimum(l=[]):\n if not l:\n return []\n return minimum(min(l[:-1]))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":23237,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 18:04:52","func_code":"def minimum(l):\n if not l:\n return []\n return minimum(min(l))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":13228,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-12 18:04:52","func_code":"def minimum(l):\n if not l:\n return []\n return minimum(min(l))","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":7750,"user":"c7fa847c-561b-4652-9a01-05f954e6c8df","date":"2018-08-13 18:24:05","func_code":"def factorial(n):\n A = 'fact.c'\n with open(A, 'w') as f:\n f.write(s.format(n))\n with open('stdout.txt', 'w+') as f:\n subprocess.run(['gcc', A, '-o', 'out.o'])\n subprocess.run(['.\/out.o'], stdout=f)\n f.seek(0)\n return int(f.readline())","func_name":"factorial","assignment_id":"factorial","academic_year":2017,"module":"ca117","test":"assert factorial(-1)==1 and factorial(0)==1 and factorial(1)==1 and factorial(2)==2 and factorial(5)==120 and factorial(20)==2432902008176640000","description":"Compute the factorial of the given number.","correct":false} {"submission_id":4661,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:30:46","func_code":"def reverse_list(l):\n if len(l) == 0:\n return l\n return reverse_list(l[-1]).append(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":14532,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:31:30","func_code":"def reverse_list(l=[]):\n if len(l) == 0:\n return l\n return reverse_list(l[-1]).append(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":21391,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:31:55","func_code":"def reverse_list(l=None):\n if len(l) == 0:\n return l\n return reverse_list(l[-1]).append(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":20036,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:32:49","func_code":"def reverse_list(l):\n if l == None:\n return l\n return reverse_list(l[-1]).append(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":18631,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:35:33","func_code":"def minimum(l, n):\n if n == 0:\n return l[0]\n min = minimum(l[1:], n - 1)\n if l[0] < min:\n return l[0]\n else:\n return min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":575,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:36:34","func_code":"def minimum(l, n=0):\n if n == 0:\n return l[0]\n min = minimum(l[1:], n - 1)\n if l[0] < min:\n return l[0]\n else:\n return min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":23959,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:37:00","func_code":"def minimum(l, n=0):\n min = minimum(l[1:], n - 1)\n if l[0] < min:\n return l[0]\n else:\n return min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":29839,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:37:26","func_code":"def minimum(l, n=0):\n if l == None:\n return l\n min = minimum(l[1:], n - 1)\n if l[0] < min:\n return l[0]\n else:\n return min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":33150,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:38:21","func_code":"def minimum(l):\n if len(l) == 0:\n return l[0]\n min = minimum(l[1:])\n if l[0] < min:\n return l[0]\n else:\n return min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":29524,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:38:38","func_code":"def minimum(l):\n if len(l) == 0:\n return l\n min = minimum(l[1:])\n if l[0] < min:\n return l[0]\n else:\n return min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":false} {"submission_id":34735,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:40:04","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n min = minimum(l[1:])\n if l[0] < min:\n return l[0]\n else:\n return min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":28685,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:40:04","func_code":"def minimum(l):\n if len(l) == 1:\n return l[0]\n min = minimum(l[1:])\n if l[0] < min:\n return l[0]\n else:\n return min","func_name":"minimum","assignment_id":"minimum","academic_year":2017,"module":"ca117","test":"assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45","description":"Return the minimum element in a list of numbers.","correct":true} {"submission_id":28185,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:41:10","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n max = maximum(l[1:])\n if l[0] > max:\n return l[0]\n else:\n return max","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":33223,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:41:10","func_code":"def maximum(l):\n if len(l) == 1:\n return l[0]\n max = maximum(l[1:])\n if l[0] > max:\n return l[0]\n else:\n return max","func_name":"maximum","assignment_id":"maximum","academic_year":2017,"module":"ca117","test":"assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9","description":"Return the maximum element in a list of numbers.","correct":true} {"submission_id":30665,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:42:12","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l[0]\n return reverse_list(l[-1]).append(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":19217,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:44:25","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l[0]\n return reverse_list(l[:-1]).append(-1)","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":463,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:45:12","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l[0]\n return l[-1] + reverse_list(l[:-1])","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":26069,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:45:58","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l[0]\n return reverse_list(l[:-1].append(l[-1]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":21583,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:46:55","func_code":"def reverse_list(l):\n if not l:\n return l\n return reverse_list(l[:-1].append(l[-1]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":690,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:47:59","func_code":"def reverse_list(l):\n if not l:\n return l\n return reverse_list(l[1:].append(l[0]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":7404,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:48:21","func_code":"def reverse_list(l):\n if not l:\n return []\n return reverse_list(l[1:].append(l[0]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":24351,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:48:52","func_code":"def reverse_list(l):\n if len(l) == 1:\n return l[0]\n return reverse_list(l[1:].append(l[0]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":37142,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:50:14","func_code":"def reverse_list(l):\n if not l:\n return l[0]\n return reverse_list(l[1:].append(l[0]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":12107,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:50:14","func_code":"def reverse_list(l):\n if not l:\n return l[0]\n return reverse_list(l[1:].append(l[0]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":20190,"user":"5aa80855-56ed-43aa-9b33-19faef108ec0","date":"2018-08-13 23:50:14","func_code":"def reverse_list(l):\n if not l:\n return l[0]\n return reverse_list(l[1:].append(l[0]))","func_name":"reverse_list","assignment_id":"reverse_recur","academic_year":2017,"module":"ca117","test":"assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85]","description":"Recursively reverse a list of elements.","correct":false} {"submission_id":3350,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 12:56:21","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":25516,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 12:56:21","func_code":"def square_area(n):\n sq = n * n\n return sq","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":27142,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:19:04","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13155,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:19:04","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n print(result)","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":false} {"submission_id":25407,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:19:04","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":4281,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:19:04","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n print(result)","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":false} {"submission_id":32453,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:20:14","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":12100,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:20:14","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":4303,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:20:14","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":40118,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:20:14","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":27304,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:21:17","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":30729,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:21:17","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":24450,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:21:17","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":30833,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:21:17","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":12307,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:21:17","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":12346,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:21:17","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":13625,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:21:17","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":2934,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:21:17","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":2345,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:53:23","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":29342,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-14 13:53:23","func_code":"def swap(a, i, j):\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n\n\ndef find_position_of_smallest(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j = j + 1\n return p\n\n\ndef sort(a):\n i = 0\n while i < len(a):\n p = find_position_of_smallest(a, i)\n swap(a, i, p)\n i = i + 1","func_name":"sort","assignment_id":"sort","academic_year":2017,"module":"ca277","test":"assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None","description":"Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.","correct":true} {"submission_id":7396,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":6188,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":25852,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":20359,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":12682,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":41114,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def square_perimeter(n):\n result = 2 * (n + n)\n return result","func_name":"square_perimeter","assignment_id":"square_perimeter","academic_year":2017,"module":"ca277","test":"assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736","description":"Returns the perimeter of a square.","correct":true} {"submission_id":17282,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":14951,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":39445,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def rectangle_perimeter(n, m):\n result = 2 * (n + m)\n return result","func_name":"rectangle_perimeter","assignment_id":"rectangle_perimeter","academic_year":2017,"module":"ca277","test":"assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798","description":"Return the perimeter of a rectangle with the given coordinates.","correct":true} {"submission_id":22200,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":20868,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def circle_area(n):\n result = 3.14 * n ** 2\n return result","func_name":"circle_area","assignment_id":"circle_area","academic_year":2017,"module":"ca277","test":"assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18","description":"Return the area of a circle.","correct":true} {"submission_id":27981,"user":"0f1cbd69-016d-4739-b232-fed37e5676ad","date":"2018-08-15 11:24:30","func_code":"def square_area(n):\n result = n * n\n return result","func_name":"square_area","assignment_id":"square_area","academic_year":2017,"module":"ca277","test":"assert square_area(0)==0 and square_area(21138)==446815044","description":"Return the area of a square.","correct":true} {"submission_id":6604,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-08-18 11:01:56","func_code":"def reverse(a):\n a = a[::-1]\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":8837,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-08-18 11:02:37","func_code":"def reverse(a):\n a = a[::-1]\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":34247,"user":"50d273d2-c9d2-425d-a22d-cc7338b6bc3e","date":"2018-08-18 11:02:37","func_code":"def reverse(a):\n a = a[::-1]\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":41943,"user":"3e515df7-ed95-4ab1-8796-23158055a6ee","date":"2018-08-20 21:28:09","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":34319,"user":"3e515df7-ed95-4ab1-8796-23158055a6ee","date":"2018-08-20 21:29:27","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":9533,"user":"3e515df7-ed95-4ab1-8796-23158055a6ee","date":"2018-08-20 21:29:27","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":12391,"user":"3e515df7-ed95-4ab1-8796-23158055a6ee","date":"2018-08-20 21:42:31","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":31257,"user":"3e515df7-ed95-4ab1-8796-23158055a6ee","date":"2018-08-20 21:42:31","func_code":"def circumference(r):\n return 2 * (3.141 * r)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":11673,"user":"3e515df7-ed95-4ab1-8796-23158055a6ee","date":"2018-08-20 21:46:27","func_code":"def circumference(r):\n return 2 * (pi * r)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":24131,"user":"3e515df7-ed95-4ab1-8796-23158055a6ee","date":"2018-08-20 21:46:27","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20402,"user":"3e515df7-ed95-4ab1-8796-23158055a6ee","date":"2018-08-20 21:46:27","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":6098,"user":"3e515df7-ed95-4ab1-8796-23158055a6ee","date":"2018-08-20 21:46:27","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":2872,"user":"3e515df7-ed95-4ab1-8796-23158055a6ee","date":"2018-08-20 21:46:27","func_code":"def circumference(r):\n return 2 * (pi * r)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":6225,"user":"3e515df7-ed95-4ab1-8796-23158055a6ee","date":"2018-08-20 21:46:27","func_code":"def circumference(r):\n return 2 * (pi * r)","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":8310,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:31:14","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":13534,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:31:14","func_code":"def double(n):\n return n * 2","func_name":"double","assignment_id":"double","academic_year":2017,"module":"ca116","test":"assert double(0)==0 and double(-7601)==-15202","description":"Double a number or a string.","correct":true} {"submission_id":2895,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:36:46","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":10107,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:36:46","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":16563,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:37:17","func_code":"def circumference(r):\n return 2 * 3.141 * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":true} {"submission_id":25479,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:37:17","func_code":"def area(r):\n return 3.141 * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":true} {"submission_id":34864,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:37:49","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":18964,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:37:49","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":1134,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:37:49","func_code":"def area(r):\n return pi * r ** 2","func_name":"area","assignment_id":"area","academic_year":2017,"module":"ca116","test":"assert area(0)==0.0 and area(-14329)==644910876.981","description":"Return the area of a circle with the given coordinates.","correct":false} {"submission_id":20447,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:37:49","func_code":"def circumference(r):\n return 2 * pi * r","func_name":"circumference","assignment_id":"circumference","academic_year":2017,"module":"ca116","test":"assert circumference(0)==0.0 and circumference(-23091)==-145057.662","description":"Return the circumference of a circle.","correct":false} {"submission_id":33276,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:46:12","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n a[len(a) - i - 1], a[i] = a[i], a[len(a) - i - 1]\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":17834,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:46:12","func_code":"def reverse(a):\n i = 0\n while i < len(a) \/ 2:\n a[len(a) - i - 1], a[i] = a[i], a[len(a) - i - 1]\n i += 1\n return a","func_name":"reverse","assignment_id":"reverse_by_swap","academic_year":2017,"module":"ca116","test":"assert reverse([])==[] and reverse([0])==[0] and reverse([-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052])==[1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103] and reverse([-103, 113466788817036974729578468346735566318, 31758, 1867157052, 10933, -70, 1867157052])==[1867157052, -70, 10933, 1867157052, 31758, 113466788817036974729578468346735566318, -103] and reverse([1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103])==[-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052] and reverse([1867157052, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, -103])==[-103, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, 1867157052] and reverse([-103, 113466788817036974729578468346735566318, 31758, -70, 10933, 1867157052, 1867157052])==[1867157052, 1867157052, 10933, -70, 31758, 113466788817036974729578468346735566318, -103] and reverse([[1]])==[[1]]","description":"Reverse a list of elements by swapping its elements.","correct":true} {"submission_id":30668,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:56:03","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef find_smallest_position(a, i):\n p = i\n j += 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, j)\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":26491,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:56:51","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, j)\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":24093,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:57:32","func_code":"def swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n return p\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, j)\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":16049,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 11:58:48","func_code":"def find_smallest_position(a, i):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n return p\n\n\ndef swap(a, i, j):\n a[i], a[j] = a[j], a[i]\n return a\n\n\ndef selection_sort(a):\n i = 0\n while i < len(a):\n p = find_smallest_position(a, i)\n swap(a, i, j)\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":11142,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 12:01:29","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n a[i], a[j] = a[j], a[i]\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":false} {"submission_id":15827,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 12:03:15","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":9653,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 12:03:15","func_code":"def selection_sort(a):\n i = 0\n while i < len(a):\n p = i\n j = i + 1\n while j < len(a):\n if a[j] < a[p]:\n p = j\n j += 1\n tmp = a[p]\n a[p] = a[i]\n a[i] = tmp\n i += 1\n return a","func_name":"selection_sort","assignment_id":"selection_sort","academic_year":2017,"module":"ca116","test":"assert selection_sort([])==[] and selection_sort([0])==[0] and selection_sort([25204, -1, -18176])==[-18176, -1, 25204] and selection_sort([-18176, -1, 25204])==[-18176, -1, 25204]","description":"Sort a list by repeatedly move minimimum of remaining sublist to front.","correct":true} {"submission_id":38099,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 12:22:02","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] < q:\n low = mid + 1\n else:\n high = mid\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false} {"submission_id":25606,"user":"85db1d22-a87d-4132-bd9a-e07bf9282015","date":"2018-08-21 12:22:02","func_code":"def bsearch(a, q):\n low = 0\n high = len(a)\n while low < high:\n mid = (low + high) \/ 2\n if a[mid] < q:\n low = mid + 1\n else:\n high = mid\n return low","func_name":"bsearch","assignment_id":"bsearch","academic_year":2017,"module":"ca116","test":"assert bsearch([],12)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],5)==4 and bsearch([1, 2, 3, 4, 6, 7, 8],1)==0 and bsearch([1, 2, 3, 4, 6, 7, 8],4)==3","description":"Search for element q in the sorted array a.","correct":false}